#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ll N, K, Q;
    cin >> N >> K >> Q;
    vector<ll> A(N);
    for (int i = 0; i < N; ++i) cin >> A[i];
    sort(A.begin(), A.end());
    priority_queue<ll> pq1;
    priority_queue<ll, vector<ll>, greater<ll>> pq2;
    auto push = [&](ll x) {
        if (pq1.size() < K) {
            pq1.push(x);
        } else {
            if (pq1.top() <= x) {
                pq2.push(x);
            } else {
                pq2.push(pq1.top());
                pq1.pop();
                pq1.push(x);
            }
        }
    };
    for(int i = 0; i < N; i++){
        push(A[i]);
    }
    while(Q--){
        ll t;
        cin >> t;
        if(t == 1){
            ll x;
            cin >> x;
            push(x);
        } else if(t == 2){
            ll x;
            cin >> x;
            ll k = pq1.top();
            if(pq2.empty()){
                pq1.pop();
                pq1.push(x + k);
                continue;
            }
            if(pq2.top() < k + x){
                pq1.pop();
                pq1.push(pq2.top());
                pq2.pop();
                pq2.push(x + k);
            }
            else{
                pq1.pop();
                pq1.push(x + k);
            }
        } else{
            cout << pq1.top() << "\n";
        }
    }
    return 0;
}