#include <bits/stdc++.h>
using namespace std;
inline int re() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
int ma[3][200020];
int main() {
  int n, m;
  cin >> n >> m;
  int f = 0;
  for (int i = 1; i <= m; i++) {
    int x, y;
    x = re();
    y = re();
    int nex = x == 1 ? 2 : 1;
    ma[x][y] = ma[x][y] == 1 ? 0 : 1;
    if (ma[x][y] == 1) {
      for (int i = max(1, y - 1); i <= min(n, y + 1); i++) {
        if (ma[nex][i] == 1) f++;
      }
    } else {
      for (int i = max(1, y - 1); i <= min(n, y + 1); i++) {
        if (ma[nex][i] == 1) f--;
      }
    }
    if (f > 0)
      puts("No");
    else
      puts("Yes");
  }
}
