class BIT:
    def __init__(self,n):
        self.n = n; self.k = [0]*(n+1)
    def a(self,i,x):
        while i<=self.n: self.k[i] += x; i += i&-i
    def s(self,i):
        t = 0
        while i>0: t += self.k[i]; i -= i&-i
        return t
    def r(self,l,r): return self.s(r)-self.s(l-1)
n,q,l = map(int,input().split())
m = 200001; b = BIT(m); c = BIT(m); f = 1
for v in map(int,input().split()): b.a(v+1,1); c.a(v+1,v)
for _ in range(q):
    p = list(map(int,input().split()))
    if p[0]==1: b.a(p[1]+1,1); c.a(p[1]+1,p[1])
    if p[0]==2: print(b.r(p[1]+1,p[2]+1),c.r(p[1]+1,p[2]+1)); f = 0
if f: print("Not Found!")