#include #define ll long long #define ld long double #define rep(i, r) for(int i = 0; i < (int)(r); i++) #define reap(i, k, r) for(ll i = (ll)(k); i < (ll)(r); i++) #define ALL(x) std::begin(x), std::end(x) #define rALL(x) std::rbegin(x), std::rend(x) #define MOD 998244353 using namespace std; int main(){ ll N, K, Q; cin >> N >> K >> Q; map mp; vector A(N); rep(i, N){ cin >> A[i]; mp[A[i]]++; } sort(ALL(A)); ll cur = A[K - 1]; ll ko = 0; for(auto [l, r] : mp){ if(l >= cur)break; ko += r; } // auto ch = [&]() -> void { // while(ko >= K){ // auto it = mp.lower_bound(cur); // it--; // auto [l, r] = *it; // ko -= r; // cur = l; // } // while(ko + mp[cur] < K){ // auto it = mp.lower_bound(cur); // it++; // auto [l, r] = *it; // if(mp[cur] == 0)mp.erase(cur); // cur = l; // } // }; while(Q--){ ll k; cin >> k; if(k == 1){ ll x; cin >> x; mp[x]++; if(x < cur){ ko++; if(ko >= K){ auto it = mp.lower_bound(cur); it--; auto [l, r] = *it; ko -= r; cur = l; } } } if(k == 2){ ll y; cin >> y; mp[cur + y]++; if(mp[cur] <= 1){ auto it = mp.lower_bound(cur); it++; auto [l, r] = *it; mp.erase(cur); cur = l; } else if(mp[cur] + ko <= K){ auto it = mp.lower_bound(cur); it++; auto [l, r] = *it; mp[cur]--; ko += mp[cur]; cur = l; } else mp[cur]--; } if(k == 3){ cout << cur << endl; } } }