#include <bits/stdc++.h>
//#include <atcoder/modint>

using namespace std;
//using namespace atcoder;
using ll = long long;
//using mint = modint998244353;

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

    /*
       priority_queueで先頭K個と後ろを管理
    */

    ll N, K, Q;
    cin >> N >> K >> Q;
    priority_queue<ll> que1;
    priority_queue<ll, vector<ll>, greater<ll>> que2;
    
    auto push=[&](ll x)->void{
        if (que1.size() < K){
            que1.push(x);
            return;
        }
        if (x >= que1.top()) que2.push(x);
        else{
            ll y = que1.top();
            que1.pop();
            que1.push(x);
            que2.push(y);
        }
    };
    auto pop=[&]()->void{
        que1.pop();
        if (!que2.empty()){
            ll y = que2.top();
            que2.pop();
            que1.push(y);
        }
    };
    auto top=[&]()->ll{
        return que1.top();
    };

    for (int i=0; i<N; i++){
        ll x;
        cin >> x;
        push(x);
    }
    while(Q--){
        ll t;
        cin >> t;
        if (t == 1){
            ll x;
            cin >> x;
            push(x);
        }
        else if (t == 2){
            ll x, y;
            cin >> y;
            x = top();
            pop();
            push(x+y);
        }
        else{
            cout << top() << '\n';
        }
    }

    return 0;
}