#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

using namespace __gnu_pbds;

using T = tree<pair<ll, int>, null_type, less<pair<ll, int>>, rb_tree_tag, tree_order_statistics_node_update>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k, q;
  cin >> n >> k >> q;
  vector<P> a(n);
  rep(i, n) cin >> a[i].first, a[i].second = i;
  T st(all(a));
  int id_next = n;
  rep(_, q) {
    int op;
    cin >> op;
    if (op == 1) {
      int x;
      cin >> x;
      st.insert({x, id_next++});
    } else if (op == 2) {
      int y;
      cin >> y;
      auto it = st.find_by_order(k - 1);
      auto [x, id] = *it;
      st.erase(it);
      st.insert({x + y, id});
    } else {
      auto it = st.find_by_order(k - 1);
      cout << it->first << '\n';
    }
  }
}