#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;
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];
    tree<pair<ll,ll>, null_type, less<pair<ll,ll>>, rb_tree_tag, tree_order_statistics_node_update> s;
    for(int i = 0; i < N; i++){
        s.insert({A[i], i});
    }
    while(Q--){
        ll t;
        cin >> t;
        if(t == 1){
            ll x;
            cin >> x;
            s.insert({x, N});
            N++;
        } else if(t == 2){
            ll y;
            cin >> y;
            auto it = s.find_by_order(K-1);
            auto [k, i] = *it;
            s.erase(it);
            s.insert({k + y, i});
        } else{
            cout << s.find_by_order(K-1)->first << "\n";
        }
    }
    return 0;
}