import sys
readline = sys.stdin.readline

class SegmentTree:
    def __init__(self, size, f=max, default=0):
        self.size = 2**(size-1).bit_length() 
        self.default = default
        self.dat = [default]*(self.size*2) 
        self.f = f

    def update(self, i, x):
        i += self.size
        self.dat[i] = x
        while i > 0:
            i >>= 1
            self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])

    def query(self, l, r):
        l += self.size
        r += self.size
        lres, rres = self.default, self.default
        while l < r:
            if l & 1:
                lres = self.f(lres, self.dat[l])
                l += 1

            if r & 1:
                r -= 1
                rres = self.f(self.dat[r], rres) 
            l >>= 1
            r >>= 1
        res = self.f(lres, rres)
        return res

N, M = map(int, readline().split())
A = list(map(int, input().split()))
T = SegmentTree(M)
for i in range(M):
    T.update(i, A[i] * M + i)
    
Q = int(readline())
for _ in range(Q):
    t, X, Y = map(int, readline().split())
    X -= 1
    if t == 1:
        A[X] += Y
        T.update(X, A[X] * M + X)
    elif t == 2:
        A[X] -= Y
        T.update(X, A[X] * M + X)
    else:
        print(T.query(0, M) % M + 1)