class SegTree: def __init__(self, init_val, ide_ele, segfunc): self.n = len(init_val) self.num = 2**(self.n-1).bit_length() self.ide_ele = ide_ele self.segfunc = segfunc self.seg = [ide_ele]*2*self.num # set_val for i in range(self.n): self.seg[i+self.num] = init_val[i] # built for i in range(self.num-1, 0, -1): self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1]) def update(self, k, x): k += self.num self.seg[k][0] += x while k: k = k >> 1 self.seg[k] = self.segfunc(self.seg[2*k], self.seg[2*k+1]) def query(self, l, r): if r <= l: return self.ide_ele l += self.num r += self.num lres = self.ide_ele rres = self.ide_ele while l < r: if r & 1: r -= 1 rres = self.segfunc(self.seg[r], rres) if l & 1: lres = self.segfunc(lres, self.seg[l]) l += 1 l = l >> 1 r = r >> 1 res = self.segfunc(lres, rres) return res def __str__(self): # for debug arr = [self.query(i,i+1) for i in range(self.n)] return str(arr) def segfunc(x, y): if x[0] > y[0]: return x elif x[0] == y[0]: if x[1] > y[1]: return x else: return y else: return y import sys import io, os input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline def main(): n, m = map(int, input().split()) A = list(map(int, input().split())) B = [] for i, a in enumerate(A): B.append([a, i]) seg = SegTree(B, [0, -1], segfunc) q = int(input()) for i in range(q): t, x, y = map(int, input().split()) x -= 1 if t == 1: seg.update(x, y) elif t == 2: seg.update(x, -y) else: res = seg.query(0, seg.n) print(res[1]+1) if __name__ == '__main__': main()