#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, q;
  cin >> n >> q;
  int a[3][n + 1];
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < n + 1; j++) {
      a[i][j] = 0;
    }
  }
  int noOfPairs = 0;
  while (q--) {
    int x, y;
    cin >> x >> y;
    a[x][y] = a[x][y] ^ 1;
    if (y - 1 > 0) {
      if (a[3 - x][y - 1] == 1 && a[x][y] == 1) {
        noOfPairs++;
      } else if (a[3 - x][y - 1] == 1)
        noOfPairs--;
    }
    if (a[3 - x][y] == 1 && a[x][y] == 1) {
      noOfPairs++;
    } else if (a[3 - x][y] == 1)
      noOfPairs--;
    if (y + 1 < n + 1) {
      if (a[3 - x][y + 1] == 1 && a[x][y] == 1) {
        noOfPairs++;
      } else if (a[3 - x][y + 1] == 1)
        noOfPairs--;
    }
    if (noOfPairs > 0)
      cout << "No" << endl;
    else
      cout << "Yes" << endl;
  }
  return 0;
}
