#include <bits/stdc++.h>
using namespace std;
const long double eps = (long double)1e-9;
const long double PI = (long double)acos(-1.0);
const int inf = 1e9 + 5;
const long long linf = 1e18L + 5;
const int mod = 1e9 + 7;
void solve() {
  int n, q, r, c;
  cin >> n >> q;
  unordered_set<int> s[3];
  set<pair<int, int> > p;
  pair<int, int> pr;
  for (int i = 0; i < q; ++i) {
    cin >> r >> c;
    if (s[r].count(c)) {
      s[r].erase(c);
      for (int j : {c - 1, c, c + 1}) {
        if (j < 1 || j > n) continue;
        if (r == 1)
          pr = {c, j};
        else
          pr = {j, c};
        auto it = p.find(pr);
        if (it != p.end()) p.erase(it);
      }
    } else {
      s[r].insert(c);
      for (int j : {c - 1, c, c + 1}) {
        if (j < 1 || j > n) continue;
        if (r == 1)
          pr = {c, j};
        else
          pr = {j, c};
        if (s[3 - r].count(j)) p.insert(pr);
      }
    }
    cout << ((int)(p).size() ? "no" : "yes") << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int test = 1;
  while (test--) {
    solve();
    cout << '\n';
  }
  return 0;
}
