class SegTree:
    DEFAULT = {
        'min': 1 << 60,
        'max': -(1 << 60),
    }

    FUNC = {
        'min': min,
        'max': max,
    }

    def __init__(self, ls, mode='min', func=None, default=None):
        """
        要素ls, 関数mode (min,max,sum,prd(product),gcd,lmc,^,&,|)
        func,defaultを指定すれば任意の関数、単位元での計算が可能
        """
        N = len(ls)
        if default == None:
            self.default = self.DEFAULT[mode]
        else:
            self.default = default
        if func == None:
            self.func = self.FUNC[mode]
        else:
            self.func = func
        self.N = N
        self.K = (N - 1).bit_length()
        self.N2 = 1 << self.K
        self.dat = [self.default] * (2**(self.K + 1))
        for i in range(self.N):  # 葉の構築
            self.dat[self.N2 + i] = ls[i]
        self.build()

    def build(self):
        for j in range(self.N2 - 1, -1, -1):
            self.dat[j] = self.func(self.dat[j << 1], self.dat[j << 1 | 1])  # 親が持つ条件

    def leafvalue(self, x):  # リストのx番目の値
        return self.dat[x + self.N2]

    def update(self, x, y):  # index(x)をyに変更
        i = x + self.N2
        self.dat[i] = y
        while i > 0:  # 親の値を変更
            i >>= 1
            self.dat[i] = self.func(self.dat[i << 1], self.dat[i << 1 | 1])
        return

    def query(self, L, R):  # [L,R)の区間取得
        L += self.N2
        R += self.N2
        vL = self.default
        vR = self.default
        while L < R:
            if L & 1:
                vL = self.func(vL, self.dat[L])
                L += 1
            if R & 1:
                R -= 1
                vR = self.func(self.dat[R], vR)
            L >>= 1
            R >>= 1
        return self.func(vL, vR)
    
    def find_r(self):
        """
        max,minのインデックスを見つける(右優先)
        """
        m_value = self.dat[1]
        ind = 1
        while ind <= (2**(self.K)):
            ind_l = ind*2
            ind_r = ind*2 + 1
            if self.dat[ind_r] == m_value:
                ind = ind_r
            else:
                ind = ind_l
        return ind - 2**(self.K)

    def find_l(self):
        """
        max,minのインデックスを見つける(左優先)
        """
        m_value = self.dat[1]
        ind = 1
        while ind <= (2**(self.K + 1)):
            ind_l = ind*2
            ind_r = ind*2 + 1
            if self.dat[ind_l] == m_value:
                ind = ind_l
            else:
                ind = ind_r
        return ind - 2**(self.K)

    def __iter__(self):
        for i in range(self.N):
            yield self[i]

    def __getitem__(self, x): return self.leafvalue(x)
    def __setitem__(self, x, val): return self.update(x, val)

N,M = map(int,input().split())
lsA = [0]+list(map(int,input().split()))
Q = int(input())
SG = SegTree(lsA,mode='max')
ans = []
for i in range(Q):
    t,x,y = map(int,input().split())
    if t == 1:
        SG[x] += y
    elif t == 2:
        SG[x] -= y
    else:
        ans.append(SG.find_r())
print(*ans,sep='\n')