#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
//using mint=modint998244353;
P op(P a,P b){
  if(a.F>b.F||(a.F==b.F&&a.S>b.S))return a;return b;
}
P e(){return P(0,0);}
signed main(){
  ll N,M;cin>>N>>M;
  vector<ll>A(M);REP(i,M)cin>>A[i];
  segtree<P,op,e>S(M);
  REP(i,M)S.set(i,P(A[i],i+1));
  ll Q;cin>>Q;
  REP(q,Q){
    ll t,x,y;cin>>t>>x>>y;
    if(t==1){
      P a=S.get(x-1);a.F+=y;
      S.set(x-1,a);
    }
    if(t==2){
      P a=S.get(x-1);a.F-=y;
      S.set(x-1,a);
    }
    if(t==3)cout<<S.all_prod().S<<endl;
  }
  return 0;
}