#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 100;
long long ksm(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) {
      ans *= a;
      ans %= 1000000007;
    }
    a *= a;
    a %= 1000000007;
    b >>= 1;
  }
  return ans;
}
int t, n, m;
int tr[N << 2], lazy[N << 2], ge[N << 2], a[N], mi[N << 2];
long long sum[N << 2];
void pushup(int x) {
  tr[x] = max(tr[x << 1], tr[x << 1 | 1]);
  mi[x] = min(mi[x << 1], mi[x << 1 | 1]);
  sum[x] = sum[x << 1] + sum[x << 1 | 1];
}
void pushdown(int x, int l, int r) {
  if (lazy[x]) {
    if (l == r) {
      sum[x] = lazy[x];
      tr[x] = lazy[x];
      mi[x] = lazy[x];
      lazy[x] = 0;
    } else {
      lazy[x << 1] = lazy[x];
      lazy[x << 1 | 1] = lazy[x];
      tr[x << 1] = mi[x << 1] = lazy[x];
      int mid = (l + r) >> 1;
      sum[x << 1] = (long long)tr[x << 1] * (mid - l + 1);
      tr[x << 1 | 1] = mi[x << 1 | 1] = lazy[x];
      sum[x << 1 | 1] = (long long)tr[x << 1 | 1] * (r - mid);
      lazy[x] = 0;
    }
  }
}
void build(int x, int l, int r) {
  lazy[x] = 0;
  if (l == r) {
    tr[x] = a[l];
    sum[x] = (long long)a[l];
    mi[x] = a[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(x << 1, l, mid);
  build(x << 1 | 1, mid + 1, r);
  pushup(x);
}
void update(int x, int l, int r, int L, int R, int zhi) {
  if (mi[x] > zhi) {
    return;
  }
  if (L <= l && r <= R && tr[x] <= zhi) {
    pushdown(x, l, r);
    lazy[x] = zhi;
    sum[x] = (long long)zhi * (r - l + 1);
    tr[x] = zhi;
    mi[x] = zhi;
    return;
  }
  pushdown(x, l, r);
  int mid = (l + r) >> 1;
  if (mid >= L) {
    update(x << 1, l, mid, L, R, zhi);
  }
  if (R > mid) {
    update(x << 1 | 1, mid + 1, r, L, R, zhi);
  }
  pushup(x);
}
long long ans;
int g = 0;
void querry(int x, int l, int r, int L, int R) {
  if (mi[x] > ans) {
    return;
  }
  if (L <= l && r <= R && sum[x] <= ans) {
    pushdown(x, l, r);
    ans -= sum[x];
    g += (r - l + 1);
    return;
  }
  pushdown(x, l, r);
  int mid = (l + r) >> 1;
  if (mid >= L) {
    querry(x << 1, l, mid, L, R);
  }
  if (R > mid) {
    querry(x << 1 | 1, mid + 1, r, L, R);
  }
  pushup(x);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  build(1, 1, n);
  for (int i = 0; i < m; i++) {
    int x;
    scanf("%d", &x);
    if (x == 1) {
      int r, zhi;
      scanf("%d%d", &r, &zhi);
      update(1, 1, n, 1, r, zhi);
    } else {
      int l;
      scanf("%d%lld", &l, &ans);
      g = 0;
      querry(1, 1, n, l, n);
      printf("%d\n", g);
    }
  }
  return 0;
}
