// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <stack>
#include <random>
#include <fstream>
#include <sstream>
#include <chrono>

#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) for (auto& x: v) cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)

#define int ll

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}

using namespace std;

#ifdef LOCAL
	#define dbg(x) cerr << #x << " : " << x << '\n'
	const int maxn = 20;
#else
	#define dbg(x)
	const int maxn = 2e5 + 20;
#endif

//tg: @galebickosikasa

ostream& operator << (ostream& out, vector<int>& v) {
	for (auto& x: v) out << x << ' ';
	return out;
}

ostream& operator << (ostream& out, pii& v) {
	out << v.fi << ", " << v.se;
	return out;
}

istream& operator >> (istream& in, pii& a) {
	in >> a.fi >> a.se;
	return in;
}

const ll inf = (ll) 2e9;
const ld pi = asin (1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

struct tree {
	vector<int> sum, mn, assign;
	int size = 0, capacity;

	tree (vector<int>& v) {
		while ((1<<size) < sz (v)) ++size;
		++size;
		size = (1<<size);
		capacity = (size>>1);
		sum = vector<int> (size);
		mn = vector<int> (size, inf);
		assign = vector<int> (size, -1);
		fr (i, sz (v)) {
			sum[i + capacity] = v[i];
			mn[i + capacity] = v[i];
		}
		for (int i = capacity - 1; i > 0; --i) {
			sum[i] = sum[i * 2] + sum[i * 2 + 1];
			mn[i] = min (mn[i * 2], mn[i * 2 + 1]);
		}
	}

	inline void push (int cur) {
		if (assign[cur] == -1) return;
		assign[cur * 2] = assign[cur * 2 + 1] = assign[cur];
		assign[cur] = -1;
	}

	inline void render (int cur, int sz) {
		sum[cur] = 0, mn[cur] = inf;
		if (assign[cur * 2] == -1) {
			sum[cur] += sum[cur * 2];
			chkmin (mn[cur], mn[cur * 2]);
		} else {
			sum[cur] += assign[cur * 2] * sz / 2;
			chkmin (mn[cur], assign[cur * 2]);
		}
		if (assign[cur * 2 + 1] == -1) {
			sum[cur] += sum[cur * 2 + 1];
			chkmin (mn[cur], mn[cur * 2 + 1]);
		} else {
			sum[cur] += assign[cur * 2 + 1] * sz / 2;
			chkmin (mn[cur], assign[cur * 2 + 1]);
		}
	}

	void set (int cur, int left, int right, int l, int r, int x) {
		if (cur >= size) return;
		if (left > r || right < l) return;
		if (l <= left && r >= right) assign[cur] = x;
		else {
			push (cur);
			set (cur * 2, left, (left + right) / 2, l, r, x);
			set (cur * 2 + 1, (left + right) / 2 + 1, right, l, r, x);
			render (cur, right - left + 1);
		}
	}

	void set (int l, int r, int x) {
		set (1, 0, capacity - 1, l, r, x);
	}

	int firstLess (int cur, int x, int sz) {
		if (sz == 1) return cur - capacity;
		push (cur);
		int ans = inf;
		if (assign[cur * 2] == -1) {
			if (mn[cur * 2] < x) ans = firstLess (cur * 2, x, (sz >> 1));
		} else {
			if (assign[cur * 2] < x) ans = firstLess (cur * 2, x, (sz >> 1));
		}
		if (ans == inf) {
			if (assign[cur * 2 + 1] == -1) {
				if (mn[cur * 2 + 1] < x) ans = firstLess (cur * 2 + 1, x, (sz >> 1));
			} else {
				if (assign[cur * 2 + 1] < x) ans = firstLess (cur * 2 + 1, x, (sz >> 1));
			}
		}
		render (cur, sz);
		return ans;
	}

	void get (int cur, int left, int right, int l, int r, int& s, int& cnt) {
		if (cur >= size) return;
		if (left > r || right < l) return;
		if (assign[cur] == -1) {
			if (mn[cur] > s) return;
			if (l <= left && r >= right && sum[cur] <= s) {
				s -= sum[cur];
				cnt += right - left + 1;
				return;
			}
		} else {
			if (assign[cur] > s) return;
			if (l <= left && r >= right && assign[cur] * (right - left + 1) <= s) {
				s -= assign[cur] * (right  - left + 1);
				cnt += right - left + 1;
				return;
			}
		}
		push (cur);
		get (cur * 2, left, (left + right) / 2, l, r, s, cnt);
		get (cur * 2 + 1, (left + right) / 2 + 1, right, l, r, s, cnt);
		render (cur, right - left + 1);
	}

	void get (int l, int r, int& s, int& cnt) {
		get (1, 0, capacity - 1, l, r, s, cnt);
	}
};

signed main () {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int n, q;
	cin >> n >> q;
	vector<int> goo (n);
	cinv (goo);
	tree t (goo);
	while (q--) {
		int qs;
		cin >> qs;
		if (qs == 1) {
			int r, y;
			cin >> r >> y;
			--r;
			int l = t.firstLess (1, y, t.capacity);
			if (l <= r) t.set (l, r, y);
		} else {
			int x, y;
			cin >> x >> y;
			--x;
			int cnt = 0;
			t.get (x, n - 1, y, cnt);
			cout << cnt << '\n';
		}
	}






}