#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

#include <atcoder/fenwicktree>

int main() {
    int N, Q, L;
    cin >> N >> Q >> L;
    vector<int> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];

    const int mx = 3e5;

    atcoder::fenwick_tree<ll> fen1(mx), fen2(mx);
    for (int i = 0; i < N; i++) {
        fen1.add(A[i], 1);
        fen2.add(A[i], A[i]);
    }

    bool ok = false;

    while (Q--) {
        int t;
        cin >> t;

        if (t == 1) {
            int l;
            cin >> l;
            fen1.add(l, 1);
            fen2.add(l, l);
        }

        else if (t == 2) {
            int l, r;
            cin >> l >> r;
            ok = true;

            cout << fen1.sum(l, r + 1) << ' ' << fen2.sum(l, r + 1) << '\n';
        }

        else {
            int m;
            cin >> m;
        }
    }

    if (!ok) cout << "Not Found!" << endl;
}