#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false) 

int main()
{
  ll N, M;
  cin >> N >> M;

  map<ll, ll> mp;
  set<pll> st;
  for (ll i = 0; i < M; i++)
  {
    ll a;
    cin >> a;
    mp[i + 1] = a;
    st.emplace(make_pair(a, i + 1));
  }

  ll Q;
  cin >> Q;
  for (ll q = 0; q < Q; q++)
  {
    ll T, X, Y;
    cin >> T >> X >> Y;

    if (T == 1)
    {
      st.erase(make_pair(mp[X], X));
      mp[X] += Y;
      st.emplace(make_pair(mp[X], X));
    }
    else if (T == 2)
    {
      st.erase(make_pair(mp[X], X));
      mp[X] -= Y;
      st.emplace(make_pair(mp[X], X));
    }
    else if (T == 3)
    {
      ll ans = (*(st.rbegin())).second;
      cout << ans << '\n';
    }

    /*
    for (auto p : st)
    {
      cerr << p.first << " " << p.second << endl;
    }
    cerr << endl;
    //*/
  }
}