from atcoder.fenwicktree import FenwickTree
n,q,l0=map(int,input().split())
a=list(map(int,input().split()))
kind=FenwickTree(2*10**5+10)
level=FenwickTree(2*10**5+10)
for i in range(n):
    kind.add(a[i],1)
    level.add(a[i],a[i])
cnt=0
for _ in range(q):
    query=list(map(int,input().split()))
    if query[0]==1:
        que,num=query
        kind.add(num,1)
        level.add(num,num)
    elif query[0]==2:
        cnt+=1
        que,left,right=query
        print(kind.sum(left,right+1),level.sum(left,right+1))
if cnt==0:
    print("Not Found!")