#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
//data
struct S {
	long long num;	//実際の値
	long long info;
	long long size;
};
//lazy
struct F {
	long long b;
	long long c;
};
//★自分で編集
//S*S->S
S op(S s_l, S s_r) { return S{ s_l.num + s_r.num ,s_l.info + s_r.info,s_l.size + s_r.size }; }

//op(a,e) = a = op(e,a)なeを返す
S e() { return S{ 0,0,0 }; }

//f(x)を返す関数
S mapping(F f, S s) {
	if (f.b != LINF) {
		s.num = s.size * f.b;
		s.info = s.size * f.c;
	}
	return s;
}

//f(g(x))の合成関数
//c(ax+b)+d = acx+(bc+d)
//rが先
F composition(F f, F g) { return (f.b == LINF ? g : f); }

//mapping(id,a) = aなidを返す
F id() { return F{ LINF,LINF }; }

int target;

bool f(S v) { return v.info <= target; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N, Q;
	cin >> N >> Q;
	vector<int>A(N);
	vector<S>a(N);
	rep(i, N) {
		cin >> A[i];
		a[i] = { A[i],1,1 };
	}
	lazy_segtree<S, op, e, F, mapping, composition, id> seg(a);
	while (Q--) {
		int t, l, r;
		cin >> t >> l >> r;
		target = l - 1;
		int xl = seg.max_right<f>(0);
		target = r;
		int xr = seg.max_right<f>(0);
		cout << xl << " " << xr << endl;
		if (1 == t) {
			//更新
			int sum = seg.prod(xl, xr).num;
			seg.apply(xl, xr, F{ 0,0 });
			seg.apply(xl, xl + 1, F{ sum ,1 });
		}
		else {
			//取得
			cout << seg.prod(xl, xr).num << endl;
		}
		/*rep(j, N) {
			cout << seg.get(j).num << " ";
		}
		cout << endl;
		rep(j, N) {
			cout << seg.get(j).info << " ";
		}
		cout << endl;*/
	}
	return 0;
}