#include <bits/stdc++.h>
using namespace std;
int n, t;
int const N = 1e5 + 10;
int f[2][N];
int main() {
  cin >> n >> t;
  int cnt = 0;
  for (int i = 1; i <= t; ++i) {
    int x, y;
    scanf("%d %d", &x, &y);
    x--;
    if (f[x][y]) {
      f[x][y] = 0;
      cnt += (f[x ^ 1][y - 1] + f[x ^ 1][y] + f[x ^ 1][y + 1]);
    } else {
      f[x][y] = 1;
      cnt -= (f[x ^ 1][y - 1] + f[x ^ 1][y] + f[x ^ 1][y + 1]);
    }
    cout << (cnt ? "NO\n" : "YES\n");
  }
  return 0;
}
