#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=2e9+1;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
int main(){
  ll n,m;cin >> n >>m;
  map<ll,ll> mp;
  rep(i,m){
    ll a;cin >> a;mp[i+1]=a;
  }
  set<pl> st;
  for(auto p:mp)st.insert({p.second,p.first});
  ll q;cin >> q;
  while(q--){
    ll t;cin >> t;
    ll x,y;cin >> x >> y;
    if(t==1){
      if(mp.count(x)){
        st.erase({mp[x],x});
        mp[x]+=y;
        st.insert({mp[x],x});
      }
    }
    if(t==2){
      if(mp.count(x)){
        st.erase({mp[x],x});
        mp[x]-=y;
        st.insert({mp[x],x});
      }
    }
    if(t==3){
      auto ans=st.rbegin();
      //cout << ans->first << endl;
      cout << ans->second << endl;
    }
  }
}