#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1};
int kx8[] = {1, 1, 2, 2, -1, -1, -2, -2};
int ky8[] = {2, -2, 1, -1, 2, -2, 1, -1};
long long bigmod(long long a, long long b, long long c) {
  if (b == 0) return 1 % c;
  long long x = bigmod(a, b / 2, c);
  x = x * x % c;
  if (b % 2 == 1) x = x * a % c;
  return x;
}
long long mod_inverse(long long a, long long mod) {
  return bigmod(a, mod - 2, mod);
}
int vis[5][100005 + 5];
int dx6[] = {1, -1, 1, 1, -1, -1};
int dy6[] = {0, 0, -1, 1, -1, 1};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  int cnt = 0;
  cin >> n >> m;
  int x, y;
  for (int j = 0; j < (m); j++) {
    cin >> x >> y;
    vis[x][y] ^= 1;
    int cost = -1;
    if (vis[x][y] == 1) cost = 1;
    for (int i = 0; i < (6); i++) {
      int xx = dx6[i] + x;
      int yy = dy6[i] + y;
      if (vis[xx][yy]) {
        cnt += cost;
      }
    }
    if (cnt == 0)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  return 0;
}
