class SegTree:
    def __init__(self, op, e, n, v=None):
        self._n = n
        self._op = op
        self._e = e
        self._log = (n - 1).bit_length()
        self._size = 1 << self._log
        self._d = [self._e()] * (self._size << 1)
        if v is not None:
            for i in range(self._n):
                self._d[self._size + i] = v[i]
            for i in range(self._size - 1, 0, -1):
                self._d[i] = self._op(self._d[i << 1], self._d[i << 1 | 1])

    def set(self, p, x):
        p += self._size
        self._d[p] = x
        while p:
            l, r = p, p^1
            if l > r: l, r = r, l
            self._d[p >> 1] = self._op(self._d[l], self._d[r])
            p >>= 1

    def get(self, p):
        return self._d[p + self._size]

    #[l, r)の区間で求める
    def prod(self, l, r):
        sml, smr = self._e(), self._e()
        l += self._size
        r += self._size
        while l < r:
            if l & 1:
                sml = self._op(sml, self._d[l])
                l += 1
            if r & 1:
                r -= 1
                smr = self._op(self._d[r], smr)
            l >>= 1
            r >>= 1
        return self._op(sml, smr)

    def all_prod(self):
        return self._d[1]
    def max_right(self, l, f):
        assert 0 <= l <= self._n
        assert f(self._e())
        if l == self._n: return self._n
        l += self._size # 葉に移動
        sm = self._e() # 確定した区間の積を保持する変数
        while True:
            while l % 2 == 0: l >>= 1 #　右ノードになるまで
            if not f(self._op(sm, self._d[l])):
                # STEP2
                while l < self._size:
                    l <<= 1
                    if f(self._op(sm, self._d[l])):
                        sm = self._op(sm, self._d[l])
                        l += 1
                return l - self._size
            sm = self._op(sm, self._d[l])
            l += 1
            if l & -l == l: break # f(prod(l, N))=Trueが確定
        return self._n

    def min_left(self, r, f):
        assert 0 <= r <= self._n
        assert f(self._e())
        if r == 0: return 0
        r += self._size
        sm = self._e()
        while True:
            r -= 1
            while r > 1 and r % 2: r >>= 1 # 左子ノードになるまで
            if not f(self._op(self._d[r], sm)):
                # STEP2
                while r < self._size:
                    r = 2 * r + 1 # 右子ノードに移動
                    if f(self._op(self._d[r], sm)):
                        sm = self._op(self._d[r], sm)
                        r -= 1
                return r + 1 - self._size
            sm = self._op(self._d[r], sm)
            if r & -r == r: break
        return 0

INF = 10**9

def op_min(x, y):
    return min(x, y)
def op_max(x, y):
    return max(x, y)

def e_min():
    return INF
def e_max():
    return -INF

import bisect
import sys
input = sys.stdin.readline
N, Q = map(int, input().split())
A = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(Q)]
Z = set()
for i, a in enumerate(A):
    Z.add((a, i))
Z = list(Z)
Z.sort()
D = dict()
for i, z in enumerate(Z):
    D[z] = i
L = len(Z)
STmin = SegTree(op_min, e_min, L)
STmax = SegTree(op_max, e_max, L)
for i, a in enumerate(A):
    idx = D[(a, i)]
    STmin.set(idx, i)
    STmax.set(idx, i)
for c, x in query:
    idx = bisect.bisect_right(Z, (x, INF))
    if c==1:
        ans = STmin.prod(idx, L)
        if ans==INF:
            print(-1)
        else:
            print(ans+1)
            a = A[ans]
            idx = D[(a, ans)]
            STmin.set(idx, INF)
            STmax.set(idx, -INF)
    else:
        ans = STmax.prod(idx, L)
        if ans==-INF:
            print(-1)
        else:
            print(ans+1)
            a = A[ans]
            idx = D[(a, ans)]
            STmin.set(idx, INF)
            STmax.set(idx, -INF)