#include <bits/stdc++.h>
using namespace std;
long long int mod = (long long int)1e9 + 7;
int main() {
  set<pair<long long int, long long int> > lava;
  set<pair<pair<long long int, long long int>,
           pair<long long int, long long int> > >
      block;
  long long int i, j, n, q, r, c;
  cin >> n >> q;
  for (i = 0; i < q; i++) {
    cin >> r >> c;
    if (lava.find({r, c}) == lava.end()) {
      lava.insert({r, c});
      if (lava.find({r + 1, c - 1}) != lava.end())
        block.insert({{r, c}, {r + 1, c - 1}});
      if (lava.find({r + 1, c}) != lava.end())
        block.insert({{r, c}, {r + 1, c}});
      if (lava.find({r + 1, c + 1}) != lava.end())
        block.insert({{r, c}, {r + 1, c + 1}});
      if (lava.find({r - 1, c - 1}) != lava.end())
        block.insert({{r - 1, c - 1}, {r, c}});
      if (lava.find({r - 1, c}) != lava.end())
        block.insert({{r - 1, c}, {r, c}});
      if (lava.find({r - 1, c + 1}) != lava.end())
        block.insert({{r - 1, c + 1}, {r, c}});
    } else {
      lava.erase({r, c});
      block.erase({{r, c}, {r + 1, c - 1}});
      block.erase({{r, c}, {r + 1, c}});
      block.erase({{r, c}, {r + 1, c + 1}});
      block.erase({{r - 1, c - 1}, {r, c}});
      block.erase({{r - 1, c}, {r, c}});
      block.erase({{r - 1, c + 1}, {r, c}});
    }
    if (block.size() == 0)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  return 0;
}
