#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const long long MOD = 1000000007;
const long long MAXN = 100010;
int n, m, T, k;
int a[3][MAXN];
int cntt;
int main() {
  int i, j, t, ii, jj;
  int n1, n2, n3;
  char ch;
  cntt = 1;
  int x, y;
  int cnt = 0;
  scanf("%d %d", &n, &m);
  while (m--) {
    scanf("%d %d", &x, &y);
    k = 1;
    if (x == 1) {
      k = 2;
    }
    if (a[x][y] == 1) {
      for (i = y - 1; i <= y + 1; i++) {
        if (a[k][i]) {
          cnt--;
        }
      }
      a[x][y] = 0;
    } else {
      for (i = y - 1; i <= y + 1; i++) {
        if (a[k][i]) {
          cnt++;
        }
      }
      a[x][y] = 1;
    }
    if (cnt) {
      printf("No\n");
    } else {
      printf("Yes\n");
    }
  }
  return 0;
}
