#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;

int main(){

    long long N, M, X, Y, T, Q, A, idx;
    cin >> N >> M;
    vector<long long> cnt(M+1);
    multiset<pair<long long, long long>> st;
    for (int i=1; i<=M; i++){
        cin >> A;
        cnt[i] = A;
        st.insert({A, i});
    }

    cin >> Q;
    for (int i=0; i<Q; i++){
        cin >> T >> X >> Y;
        if (T == 1){
            st.erase({cnt[X], X});
            cnt[X] += Y;
            st.insert({cnt[X], X});
        }
        else if (T == 2){ 
            st.erase({cnt[X], X});
            cnt[X] -= Y;
            st.insert({cnt[X], X});
        }
        else if (T == 3){
            tie(A, idx) = *st.rbegin();
            cout << idx << endl;
        }
    }

    return 0;
}