import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

lim = 550
# lim=5

n = II()
aa = [LI()]
ss = []
b = n+1

for qi in range(II()):
    if qi%lim == 0:
        naa = [[]]
        ss = [set()]
        for r in aa:
            for a in r:
                if len(naa[-1]) == lim:
                    naa.append([])
                    ss.append(set())
                naa[-1].append(a)
                ss[-1].add(a)
        aa = naa
    ta = LI()
    if ta[0] == 1:
        a = ta[1]
        if a:
            g = 0
            while a not in ss[g]: g += 1
            i = aa[g].index(a)
        else:
            g = len(aa)-1
            i = len(aa[g])
        aa[g].insert(i, b)
        ss[g].add(b)
        b += 1
    elif ta[0] == 2:
        g=0
        while len(aa[g])==0:g+=1
        a = aa[g][0]
        del aa[g][0]
        ss[g].discard(a)
    else:
        k = ta[1]-1
        g = 0
        while len(aa[g]) <= k:
            k -= len(aa[g])
            g += 1
        print(aa[g][k])
    # print(ta,aa)