#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
using ll = long long;
ll n, k, q, a[1 << 17];
signed main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> k >> q;
  rep(i, n) cin >> a[i];
  sort(a, a + n);
  priority_queue<ll> front;
  priority_queue<ll, vector<ll>, greater<>> back;
  rep(i, k - 1) front.push(a[i]);
  for (int i = k - 1; i < n; ++i) back.push(a[i]);
  rep(_, q) {
    int qt;
    cin >> qt;
    if (qt == 1) {
      ll x;
      cin >> x;
      if (back.top() <= x) {
        back.push(x);
      } else {
        front.push(x);
        back.push(front.top());
        front.pop();
      }
    } else if (qt == 2) {
      ll y;
      cin >> y;
      back.push(back.top() + y);
      back.pop();
    } else {
      cout << back.top() << '\n';
    }
  }
}