#include<bits/stdc++.h>
using namespace std;

int main(){
  using ll=long long;
  int n,k,q;
  cin>>n>>k>>q;
  priority_queue<ll> pq,pq2;
  vector<ll> a(n);
  for (int i=0;i<n;i++) cin>>a[i];
  sort(a.begin(),a.end());
  for (int i=0;i<k;i++) pq.push(a[i]);
  for (int i=k;i<n;i++) pq2.push(-a[i]);
  pq2.push(-1e18);
  while (q--){
    int t;
    cin>>t;
    if (t==1){
      ll x;
      cin>>x;
      pq2.push(-x);
      while (pq.top()>-pq2.top()){
        ll top=pq.top();
        ll top2=pq2.top();
        pq.pop();
        pq2.pop();
        pq2.push(-top);
        pq.push(-top2);
      }
    }
    if (t==2){
      ll y;
      cin>>y;
      ll top=pq.top();
      pq.pop();
      pq.push(top+y);
      while (pq.top()>-pq2.top()){
        ll top=pq.top();
        ll top2=pq2.top();
        pq.pop();
        pq2.pop();
        pq2.push(-top);
        pq.push(-top2);
      }
      //cout<<pq.top()<<endl;
    }
    if (t==3){
      cout<<pq.top()<<endl;
    }
  }
}