from bisect import bisect_left, bisect_right

class BIT:
    def __init__(self, A):
        self.size = len(A)
        self.bit = [0]*(len(A)+1)
        for i in range(len(A)):
            self.add(i, A[i])

    def sum(self, i):
        i += 1
        ans = 0
        while i > 0:
            ans += self.bit[i]
            i -= -i&i
        return ans
    
    def query(self, l, r):
        if l == 0:
            return self.sum(r-1)
        else:
            return self.sum(r-1)-self.sum(l-1)
    
    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.bit[i] += x
            i += -i&i

N, Q, L0 = map(int, input().split())
A = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(Q)]

def compress(A):
    S = sorted(set(A))
    D = dict()
    for i in range(len(S)):
        D[S[i]] = i
    return D, S

level = A[:]
for i in range(Q):
    if query[i][0] == 1:
        level.append(query[i][1])
D, S = compress(level)

B1 = BIT([0]*len(D))
B2 = BIT([0]*len(D))
for i in range(N):
    B1.add(D[A[i]], 1)
    B2.add(D[A[i]], A[i])

ans = []
for i in range(Q):
    if query[i][0] == 1:
        level = query[i][1]
        B1.add(D[level], 1)
        B2.add(D[level], level)
    elif query[i][0] == 2:
        l, r = query[i][1:]
        left = bisect_left(S, l)
        right = bisect_right(S, r)
        ans.append((B1.query(left, right), B2.query(left, right)))

if len(ans) >= 1:
    for a, b in ans:
        print(a, b)
else:
    print("Not Found!")