#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, c, k, n, q, r;
  k = 0;
  cin >> n >> q;
  int a[2][n];
  for (i = 0; i < n; i++) a[0][i] = a[1][i] = 0;
  while (q--) {
    cin >> r >> c;
    r--;
    c--;
    if (a[r][c] == 0) {
      a[r][c] = 1;
      if (a[(r + 1) % 2][c] == 1) k++;
      if (c > 0) {
        if (a[(r + 1) % 2][c - 1] == 1) k++;
      }
      if (c < (n - 1)) {
        if (a[(r + 1) % 2][c + 1] == 1) k++;
      }
    } else {
      a[r][c] = 0;
      if (a[(r + 1) % 2][c] == 1) k--;
      if (c > 0) {
        if (a[(r + 1) % 2][c - 1] == 1) k--;
      }
      if (c < (n - 1)) {
        if (a[(r + 1) % 2][c + 1] == 1) k--;
      }
    }
    if (k > 0)
      cout << "No\n";
    else
      cout << "Yes\n";
  }
  return 0;
}
