#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int op(int a, int b) { return max(a, b); }
int e() { return -1; }
int target;
bool f(int v) { return v <= target; }
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, q; cin >> n >> q;
	vector<int>a(n);
	rep(i, n)cin >> a[i];
	segtree<int, op, e>seg(a);
	while (q--) {
		int c, x; cin >> c >> x;
		if (c == 1) {
			target = x;
			auto index = seg.max_right<f>(0);
			if (index == n) {
				cout << -1 << endl;
			}
			else {
				cout << index + 1 << endl;
				seg.set(index, -1);
			}
		}
		else {
			target = x;
			auto index = seg.min_left<f>(n);
			if (index == 0) {
				cout << -1 << endl;
			}
			else {
				cout << index << endl;
				seg.set(index - 1, -1);
			}
		}
		//rep(i, n)cout << seg.get(i) << " ";
	//	cout << endl;
	}
	return 0;
}