#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000000LL


int main(){
	
	long long N,Q,L;
	cin>>N>>Q>>L;
	
	fenwick_tree<long long> fc(200005),fs(200005);
	rep(i,N){
		int a;
		scanf("%d",&a);
		fc.add(a,1);
		fs.add(a,a);
	}
	int outs = 0;
	rep(_,Q){
		int t;
		scanf("%d", &t);
		if(t==1){
			int l;
			scanf("%d",&l);
			fc.add(l,1);
			fs.add(l,l);
		}
		else if(t==2){
			outs++;
			int l,r;
			scanf("%d %d",&l,&r);
			printf("%lld %lld\n",fc.sum(l,r+1),fs.sum(l,r+1));
		}
		else{
			int m;
			scanf("%d",&m);
		}
	}
	if(outs==0){
		cout<<"Not Found!"<<endl;
	}
	
	return 0;
}