#include <atcoder/all>
#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
using namespace atcoder;
using namespace std;

typedef long long ll;

int main() {
    ll n, q;
    cin >> n >> q;
    vector<ll> L(q), A(n);
    ll L0;
    cin >> L0;
    L0 = 200100;
    rep(i, 0, n) cin >> A[i];
    vector<ll> qt(q), l(q), r(q), m(q);
    int ct2 = 0;
    rep(i, 0, q) {
        cin >> qt[i];
        if (qt[i] == 1)
            cin >> l[i];
        if (qt[i] == 2)
            cin >> l[i] >> r[i];
        if (qt[i] == 3)
            cin >> m[i];
        ct2 += (qt[i] == 2);
        L[i] = L0;
    }
    if (ct2 == 0) {
        cout << "Not Found!\n";
        return 0;
    }
    fenwick_tree<ll> fw1(L0 + 1), fw2(L0 + 1);
    rep(i, 0, n) {
        fw1.add(A[i], 1);
        fw2.add(A[i], A[i]);
    }
    rep(i, 0, q) {
        if (qt[i] == 1) {
            fw1.add(l[i], 1);
            fw2.add(l[i], l[i]);
        }
        if (qt[i] == 2) {
            ll ans1 = fw1.sum(l[i], r[i] + 1);
            ll ans2 = fw2.sum(l[i], r[i] + 1);
            cout << ans1 << " " << ans2 << "\n";
        }
    }
}