/* -*- coding: utf-8 -*-
 *
 * 3327.cc:  No.3327 縺・ｋ縺帙∞縲√・繝ｪ繧ｪ繝溘ヮ縺ｶ縺､縺代ｓ縺・- yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

template <typename T>
struct SegTreeMax {
  int e2;
  vector<T> nodes;
  T defv;
  SegTreeMax() {}

  void init(int n, T _defv) {
    defv = _defv;
    for (e2 = 1; e2 < n; e2 <<= 1);
    nodes.assign(e2 * 2, defv);
  }

  T &geti(int i) { return nodes[e2 - 1 + i]; }
  void seti(int i, T v) { geti(i) = v; }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = max(nodes[j * 2 + 1], nodes[j * 2 + 2]);
  }

  void set(int i, T v) {
    int j = e2 - 1 + i;
    nodes[j] = v;
    while (j > 0) {
      j = (j - 1) / 2;
      nodes[j] = max(nodes[j * 2 + 1], nodes[j * 2 + 2]);
    }
  }

  T max_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return defv;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    int im = (i0 + i1) / 2;
    T v0 = max_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = max_range(r0, r1, k * 2 + 2, im, i1);
    return max(v0, v1);
  }
  T max_range(int r0, int r1) { return max_range(r0, r1, 0, 0, e2); }
};

/* global variables */

int as[MAX_N];
SegTreeMax<int> st;

/* subroutines */

/* main */

int main() {
  int n, qn;
  scanf("%d%d", &n, &qn);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  st.init(n, 0);
  for (int i = 0; i < n; i++) st.seti(i, as[i]);
  st.setall();

  while (qn--) {
    int op, x;
    scanf("%d%d", &op, &x);

    if (op == 1) {
      if (st.max_range(0, n) <= x) puts("-1");
      else {
	int p0 = -1, p1 = n;
	while (p0 + 1 < p1) {
	  int p = (p0 + p1) / 2;
	  if (st.max_range(0, p) > x) p1 = p;
	  else p0 = p;
	}
	printf("%d\n", p1);
	st.set(p1 - 1, 0);
      }
    }
    else {
      if (st.max_range(0, n) <= x) puts("-1");
      else {
	int p0 = -1, p1 = n;
	while (p0 + 1 < p1) {
	  int p = (p0 + p1) / 2;
	  if (st.max_range(p, n) > x) p0 = p;
	  else p1 = p;
	}
	printf("%d\n", p0 + 1);
	st.set(p0, 0);
      }
    }
  }
  
  return 0;
}