#include <bits/stdc++.h>
using namespace std;
void solve();
mt19937 rnd(2007);
signed main() {
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  swap(rng, rnd);
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  solve();
}
void solve() {
  long long n;
  cin >> n;
  vector<vector<long long>> a(2, vector<long long>(n));
  long long q;
  cin >> q;
  long long cnt = 0;
  for (long long(qwe) = 0; (qwe) < (q); ++(qwe)) {
    long long x, y;
    cin >> x >> y;
    x--;
    y--;
    long long oldcnt = 0;
    for (long long ny = y - 1; ny <= y + 1; ++ny) {
      if (0 <= ny && ny + 1 < n) {
        oldcnt += (a[0][ny] | a[0][ny + 1]) & (a[1][ny] | a[1][ny + 1]);
      }
    }
    a[x][y] = a[x][y] ^ 1;
    long long ncnt = 0;
    for (long long ny = y - 1; ny <= y + 1; ++ny) {
      if (0 <= ny && ny + 1 < n) {
        ncnt += (a[0][ny] | a[0][ny + 1]) & (a[1][ny] | a[1][ny + 1]);
      }
    }
    cnt -= oldcnt;
    cnt += ncnt;
    if (cnt == 0)
      cout << "Yes" << '\n';
    else
      cout << "No" << '\n';
  }
}
