#include using namespace std; using ll = long long; bool chmin(auto &a, auto b) { return a > b ? a = b, true : false; } bool chmax(auto &a, auto b) { return a < b ? a = b, true : false; } template> struct top_k_set { top_k_set(int _k) : k(_k), lower_sum(0) {} void insert(T1 x) { if (k > 0 && ((int)lower.size() < k || Compare()(x, *prev(lower.end())))) { lower_sum += x; lower.insert(x); } else { upper.insert(x); } normalize(); } void erase(T1 x) { auto it = lower.find(x); if (it != lower.end()) { lower_sum -= *it; lower.erase(it); } else { it = upper.find(x); assert(it != upper.end()); upper.erase(it); } normalize(); } T1 kth_val() const { assert((int)lower.size() == k); return *prev(lower.end()); } T2 sum() const { return lower_sum; } private: int k; multiset lower, upper; T2 lower_sum; void normalize() { while ((int)lower.size() > k) { auto it = prev(lower.end()); upper.insert(*it); lower_sum -= *it; lower.erase(it); } while ((int)lower.size() < k && upper.size()) { auto it = upper.begin(); lower_sum += *it; lower.insert(*it); upper.erase(it); } } }; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int N, K, Q; cin >> N >> K >> Q; top_k_set S(K); for (int i = 0; i < N; i++) { int A; cin >> A; S.insert(A); } while (Q--) { int t; cin >> t; if (t == 1) { int x; cin >> x; S.insert(x); } else if (t == 2) { int y; cin >> y; auto x = S.kth_val(); S.erase(x); S.insert(x + y); } else { cout << S.kth_val() << '\n'; } } }