import sys
input = sys.stdin.readline


class Fenwick_Tree:
    def __init__(self, n):
        self._n = n
        self.data = [0] * n

    def add(self, p, x):
        assert 0 <= p < self._n
        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, l, r):
        assert 0 <= l <= r <= self._n
        return self._sum(r) - self._sum(l)

    def _sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s

    # T.sum(0, x) <= kとなる最大のxを返す。
    def get(self, k):
        k += 1
        x, r = 0, 1
        while r < self._n:
            r <<= 1
        len = r
        while len:
            if x + len - 1 < self._n:
                if self.data[x + len - 1] < k:
                    k -= self.data[x + len - 1]
                    x += len
            len >>= 1
        return x

    def __str__(self):
        temp = []
        for i in range(self._n):
            temp.append(str(self.sum(i, i + 1)))
        return ' '.join(temp)



N, Q, L = map(int, input().split())
A = list(map(int, input().split()))
M = 2 * 10 ** 5 + 5
Tn = Fenwick_Tree(M)
Ts = Fenwick_Tree(M)
for a in A:
    Tn.add(a, 1)
    Ts.add(a, a)
ans = []
for _ in range(Q):
    q = list(map(int, input().split()))
    if q[0] == 1:
        l = q[1]
        Tn.add(l, 1)
        Ts.add(l, l)
    elif q[0] == 2:
        l, r = q[1:]
        ans.append((Tn.sum(l, r + 1), Ts.sum(l, r + 1)))

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