#include<bits/stdc++.h>
using namespace std;

#include<atcoder/all>
using namespace atcoder;
using mint=atcoder::modint998244353;

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#define int long long

signed main(){
	int N,Q,L0;cin>>N>>Q>>L0;

	vector<int> A(N);for(auto&&e:A)cin>>e;

	const int max_Q=1000000;

	fenwick_tree<int> f(max_Q+1),g(max_Q+1);

	for(auto&&e:A)f.add(e,e),g.add(e,1);

	bool flg=0;

	while(Q--){
		int t;cin>>t;
		if(t==1){
			int l;cin>>l;
			f.add(l,l);
			g.add(l,1);
		}
		if(t==2){
			int l,r;cin>>l>>r;
			int res1=g.sum(0,r+1)-g.sum(0,l);
			int res2=f.sum(0,r+1)-f.sum(0,l);
			cout<<res1<<" "<<res2<<endl;
			flg=1;
		}
		if(t==3){
			int m;cin>>m;
			L0=m;
		}
	}

	if(flg==0){
		cout<<"Not Found!"<<endl;
	}
}