#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
inline int read() {
  int ret = 0, sgn = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') sgn = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    ret = ret * 10 + ch - '0';
    ch = getchar();
  }
  return ret * sgn;
}
inline void Out(int a) {
  if (a > 9) Out(a / 10);
  putchar(a % 10 + '0');
}
long long __gcd(long long a, long long b) {
  return b == 0 ? a : __gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * b / __gcd(a, b); }
long long qpow(long long a, long long b, long long mod) {
  if (a >= mod) a = a % mod + mod;
  long long ans = 1;
  while (b) {
    if (b & 1) {
      ans = ans * a;
      if (ans >= mod) ans = ans % mod + mod;
    }
    a *= a;
    if (a >= mod) a = a % mod + mod;
    b >>= 1;
  }
  return ans;
}
int Fermat(int a, int p) { return qpow(a, p - 2, p); }
int exgcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int g = exgcd(b, a % b, x, y);
  int t = x;
  x = y;
  y = t - a / b * y;
  return g;
}
int mod_reverse(int a, int p) {
  int d, x, y;
  d = exgcd(a, p, x, y);
  if (d == 1)
    return (x % p + p) % p;
  else
    return -1;
}
long long china(int a[], int b[], int n) {
  int M = 1, y, x = 0;
  for (int i = 0; i < n; ++i) M *= a[i];
  for (int i = 0; i < n; ++i) {
    int w = M / a[i];
    int tx = 0;
    int t = exgcd(w, a[i], tx, y);
    x = (x + w * (b[i] / t) * x) % M;
  }
  return (x + M) % M;
}
bool vis[3][100010];
int n, q, ans = 0;
void slove() {
  int x, y, t;
  scanf("%d%d", &x, &y);
  x--;
  t = (x + 1) % 2;
  if (vis[x][y]) {
    vis[x][y] = 0;
    ans = ans - vis[t][y - 1] - vis[t][y] - vis[t][y + 1];
  } else {
    vis[x][y] = 1;
    ans = ans + vis[t][y - 1] + vis[t][y] + vis[t][y + 1];
  }
}
int main() {
  scanf("%d%d", &n, &q);
  int x, y, t;
  while (q--) {
    slove();
    if (!ans)
      puts("Yes");
    else
      puts("No");
  }
  return 0;
}
