#include<bits/stdc++.h>
using namespace std;
int n, m;
struct node {
	int l, r, maxa, maxb, taga, tagb, changetag;
} b[1600005];
inline void update(int p) {
	if (b[2 * p].maxa >= b[2 * p + 1].maxa) {
		b[p].maxa = b[2 * p].maxa;
		b[p].maxb = b[2 * p].maxb;
	} else {
		b[p].maxa = b[2 * p + 1].maxa;
		b[p].maxb = b[2 * p + 1].maxb;
	}
}
inline void push_down(int p) {

	if (b[p].taga == 1) { // 左
		b[2 * p].taga = b[2 * p + 1].taga = b[p].taga;
		b[2 * p].tagb = b[2 * p + 1].tagb = b[p].tagb;
		b[2 * p].maxa = b[2 * p].r - b[p].tagb;
		b[2 * p + 1].maxa = b[2 * p + 1].r - b[p].tagb;
		b[2 * p].maxb = b[2 * p].r  ;
		b[2 * p + 1].maxb = b[2 * p + 1].r  ;
		b[p].taga = b[p].tagb = 0;
	} else if (b[p].taga == 2) { // R
		b[2 * p].taga = b[2 * p + 1].taga = b[p].taga;
		b[2 * p].tagb = b[2 * p + 1].tagb = b[p].tagb;
		b[2 * p].maxa =  b[p].tagb - b[2 * p].l;
		b[2 * p + 1].maxa =  b[p].tagb - b[2 * p + 1].l;
		b[2 * p].maxb = b[2 * p].l  ;
		b[2 * p + 1].maxb = b[2 * p + 1].l  ;
		b[p].taga = b[p].tagb = 0;
	}
	if (b[p].changetag) {
		b[p].changetag = 0;
		b[2 * p].maxa = b[2 * p + 1].maxa = 0;
		b[2 * p + 1].maxb = b[2 * p + 1].l;
		b[2 * p].maxb = b[2 * p].l;
		b[2 * p].changetag = b[2 * p + 1].changetag = 1;
		b[2 * p].taga = b[2 * p].tagb = b[2 * p + 1].taga = b[2 * p + 1].tagb = 0;
		return;
	}
}
inline void change(int p, int l, int r, int taga, int tagb) {
	//	cout << l << "|" << r << "|" << taga << " " << tagb << " " << b[p].l << ";" << b[p].r << endl;
	if (l > r) return;
	if (b[p].l >= l && b[p].r <= r) {
		push_down(p);
		if (taga == 1) {
			b[p].maxa = b[p].r - tagb;
			b[p].maxb = b[p].r;
		} else {
			b[p].maxa = tagb - b[p].l;
			b[p].maxb = b[p].l;
		}
		b[p].taga = taga;
		b[p].tagb = tagb;
		return;
	}
	push_down(p);
	int mid = (b[p].l + b[p].r) >> 1;
	if (r <= mid) change(2 * p, l, r, taga, tagb);
	else if (l > mid) change(2 * p + 1, l, r, taga, tagb);
	else {
		change(2 * p, l, mid, taga, tagb);
		change(2 * p + 1, mid + 1, r, taga, tagb);
	}
	update(p);
	//	cout << b[p].maxa << ' ' << b[p].maxb << " " << b[p].l << " " << b[p].r << "\n";
}
inline void build(int p, int l, int r) {
	b[p].l = l;
	b[p].r = r;
	b[p].taga = b[p].tagb = 0;
	if (l == r) {
		b[p].maxb = l;
		b[p].maxa = 0;
		return;
	}
	build(2 * p, l, (l + r) >> 1);
	build(2 * p + 1, ((l + r) >> 1) + 1, r);
	update(p);
}
int t[200005];
inline int lowbit(int p) {
	return p & -p;
}
inline void add(int p, int q) {
	while (p <= n) {
		t[p] += q;
		p += lowbit(p);
	}
}
inline int query(int p) {
	int cnt = 0;
	while (p >= 1) {
		cnt += t[p];
		p -= lowbit(p);
	}
	return  cnt;
}
inline int findl(int p) {
	if (query(p - 1) == 0) return -1;
	int l = 1, r = p - 1, mid;
	while (l < r) {
		mid = (l + r + 1) >> 1;
		if (query(p - 1) - query(mid - 1)) l = mid;
		else r = mid - 1;
	}
	return l;
}
inline int findr(int p) {
	if (query(n) - query(p) == 0) return -1;
	int l = p + 1, r = n, mid;
	while (l < r) {
		mid = (l + r) >> 1;
		if (query(mid) - query(p)) r = mid;
		else l = mid + 1;
	}
	return l;
}
inline void solve(int p, int q) {
	//	cout << p << "===" << q << endl;
	if (p == -1 && q == -1) {
		push_down(1);
		b[1].changetag = 1;
		b[1].maxa = 0;
		b[1].maxb = 1;
		return;
	}
	if (p == -1) {
		change(1, 1, q, 2, q);
	} else if (q == -1) {
		change(1, p, n, 1, p);
	} else {
		int mid = (p + q) >> 1;
		if (mid - p > q - mid) {
			change(1, p, mid - 1, 1, p);
			change(1, mid, q, 2, q);
		} else {
			change(1, p, mid, 1, p);
			change(1, mid + 1, q, 2, q);
		}
	}
}
int tab[200005];
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	build(1, 1, n);
	int p, q;
	for (int i = 1; i <= m; i++) {
		cin >> p >> q;
		if (p == 1) {
			cout << b[1].maxb << "\n";
			tab[q] = b[1].maxb;
			q = b[1].maxb;
			add(q, 1);
			solve(findl(q), q);
			solve(q, findr(q));
		} else {
			add(tab[q], -1);
			solve(findl(tab[q]), findr(tab[q]));
			tab[q] = 0;
		}
	}
}