#include <bits/stdc++.h>
using namespace std;
long long ss[1100000], pp[1100000], A[1100000], B[1100000];
multiset<pair<long long, long long> > qq;
long long n, m;
void add(long long a, long long b) {
  ss[a] = b;
  pp[b] = a;
  long long val = (b - a + 2) / 2;
  if (a == 1 || b == n) val = b - a + 1;
  qq.insert(make_pair(-val, a));
}
void del(long long a, long long b) {
  long long val = (b - a + 2) / 2;
  if (a == 1 || b == n) val = b - a + 1;
  qq.erase(make_pair(-val, a));
}
void put(long long a, long long b, long long c) {
  long long d;
  if (a == 1)
    d = 1;
  else if (b == n)
    d = n;
  else
    d = (a + b) / 2;
  B[d] = 1;
  A[c] = d;
  cout << d << "\n";
  del(a, b);
  if (B[d + 1] == 0) {
    long long xx = d + 1;
    long long yy = b;
    add(xx, yy);
  }
  if (B[d - 1] == 0) {
    long long yy = d - 1;
    long long xx = a;
    add(xx, yy);
  }
}
void remov(long long a) {
  B[a] = 0;
  long long aa = a, bb = a;
  if (B[a - 1] == 0) {
    aa = pp[a - 1];
    del(aa, a - 1);
  }
  if (B[a + 1] == 0) {
    bb = ss[a + 1];
    del(a + 1, bb);
  }
  add(aa, bb);
}
signed main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m;
  add(1, n);
  B[0] = 1;
  B[n + 1] = 1;
  while (m > 0) {
    m--;
    long long a, b;
    cin >> a >> b;
    if (a == 1) {
      auto x = qq.begin()->second;
      long long y = ss[x];
      qq.erase(qq.begin());
      put(x, y, b);
    } else {
      long long d = A[b];
      remov(d);
    }
  }
}
