#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<vector<int>> g;
vector<vector<int>> dir = {{1, -1}, {1, 0}, {1, 1}, {-1, -1}, {-1, 0}, {-1, 1}};
int n, q;
int get(int r, int c) {
  int res = 0;
  for (vector<int> x : dir) {
    int nr = r + x[0];
    int nc = c + x[1];
    if (nr < 0 || nr == 2 || nc < 0 || nc == n) continue;
    res += g[nr][nc];
  }
  return res;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> q;
  g.resize(2, vector<int>(n));
  int blocked = 0;
  for (int i = 0; i < q; i++) {
    int r, c;
    cin >> r >> c;
    r--;
    c--;
    if (g[r][c]) {
      blocked -= get(r, c);
    } else {
      blocked += get(r, c);
    }
    g[r][c] = !g[r][c];
    cout << (blocked ? "No\n" : "Yes\n");
  }
}
