#include <iostream>

#include <atcoder/fenwicktree>
using namespace std;

int main() {
    cin.tie(nullptr), ios::sync_with_stdio(false);

    int N, Q, L0;
    cin >> N >> Q >> L0;
    
    // vector<int> L(Q + 1);
    // L[0] = L0;

    auto Li = L0;

    constexpr int K = 201010;

    atcoder::fenwick_tree<int> fw0(K);
    atcoder::fenwick_tree<long long> fw1(K);

    for (int i = 0; i < N; ++i) {
        int a;
        cin >> a;
        fw0.add(a, 1);
        fw1.add(a, a);
    }

    bool has2 = false;

    for (int i = 1; i <= Q; ++i) {
        int tp;
        cin >> tp;
        if (tp == 1) {
            int l;
            cin >> l;
            fw0.add(l, 1);
            fw1.add(l, l);
        } else if (tp == 2) {
            int l, r;
            cin >> l >> r;
            ++r;
            cout << fw0.sum(l, r) << ' ' << fw1.sum(l, r) << '\n';
            has2 = true;
        } else {
            cin >> Li;
        }
    }

    if (!has2) puts("Not Found!");
}