#include <bits/stdc++.h>
using namespace std;
int a[2][100005];
int ob = 0, x, y, n, t;
void solve() {
  int d = (a[x][y] == 0) ? 1 : -1;
  a[x][y] = 1 - a[x][y];
  for (int i = -1; i <= 1; ++i) {
    if (y + i >= n || y + i < 0) continue;
    if (a[1 - x][y + i] == 1) ob += d;
  }
}
int main() {
  cin >> n >> t;
  while (t--) {
    cin >> x >> y;
    x--;
    y--;
    solve();
    if (ob > 0)
      cout << "No" << endl;
    else
      cout << "Yes" << endl;
  }
  return 0;
}
