#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <bitset>
#include <vector>
#include <set>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <fstream>
#include <cmath>
#include <unordered_map>
#include <stack>
#include <math.h>
#include <queue>

typedef long long ll;
using namespace std;

const ll inf = 1e18;

struct Segment
{
	ll d;
	ll l, r;
	ll il, ir;
};

bool cmp(const Segment& s1, const Segment& s2)
{
	if (s1.d == 0 && s2.d == 0)
		return s1.il < s2.il;
	if (s1.d * s2.d == 0)
		return s1.d == 0;
	ll a = (s1.d - 1) / 2;
	ll b = (s2.d - 1) / 2;
	return (a != b ? a < b : s1.il > s2.il);
}

vector<Segment> diss;

ll n;

void add(ll x)
{
	sort(diss.begin(), diss.end(), cmp);
	if (diss.back().l == -1)
	{
		Segment& s = diss.back();
		s.l = x;
		s.il = 1;
		--s.d;
		cout << 1 << endl;
	}
	else if (diss.back().r == -1)
	{
		Segment& s = diss.back();
		s.r = x;
		s.ir = n;
		--s.d;
		cout << n << endl;
	}
	else
	{
		Segment s = diss.back();
		diss.pop_back();

		ll im = s.il + (s.d - 1) / 2 + 1;
		diss.push_back({ (s.d - 1) / 2, s.l, x, s.il, im });
		diss.push_back({ s.d / 2, x, s.r, im, s.ir});
		cout << diss.back().il << endl;
	}

}

void rem(ll x)
{
	ll il = -1, ir = -1;
	for (ll i = 0; i < diss.size(); ++i)
	{
		if (diss[i].l == x)
			il = i;
		else if (diss[i].r == x)
			ir = i;
	}

	if (ir == -1)
	{
		diss[il].l = -1;
		diss[il].il = -1;
		++diss[il].d;
	}
	else if (il == -1)
	{
		diss[ir].r = -1;
		diss[ir].ir = -1;
		++diss[ir].d;
	}
	else
	{
		Segment& r = diss[ir];
		Segment& l = diss[il];
		r.r = l.r;
		r.ir = l.ir;
		r.d += l.d + 1;
		diss.erase(diss.begin() + il);
	}

}


int main()
{
	ll k;
	cin >> n >> k;
	ll cnt = 0;
	diss.push_back({ n, -1, -1, -1, -1 });
	while (k--)
	{
		string s;
		cin >> s;
		if (s == "+")
			add(++cnt);
		else
			rem(-1 * stoi(s));
	}
}