#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, q;
int r[maxn], c[maxn];
int err = 0;
bool grid[3][maxn];
int main() {
  cin >> n >> q;
  memset(grid, 1, sizeof(grid));
  for (int i = 0; i < q; i++) {
    cin >> r[i] >> c[i];
    int cnt = 0, cnt2 = 0;
    if (!grid[r[i]][c[i]]) {
      for (int j = max(1, c[i] - 1); j <= min(n, c[i] + 1); j++) {
        if (!grid[3 - r[i]][j]) {
          ++cnt;
        }
      }
      err -= cnt;
    } else {
      for (int j = max(1, c[i] - 1); j <= min(n, c[i] + 1); j++) {
        if (!grid[3 - r[i]][j]) {
          ++cnt2;
        }
      }
      err += cnt2;
    }
    grid[r[i]][c[i]] ^= 1;
    puts(err ? "No" : "Yes");
  }
  return 0;
}
