#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
const double PI = 3.1415926535898;
const long long mod = 2017;
long long a[3][N];
void solve() {
  long long n, q;
  cin >> n >> q;
  long long ok = 0;
  while (q--) {
    long long x, y;
    cin >> x >> y;
    a[x][y] = !a[x][y];
    long long tmp;
    if (x == 1)
      tmp = 2;
    else
      tmp = 1;
    if (a[x][y]) {
      for (int i = y - 1; i <= y + 1; i++) {
        if (a[tmp][i]) ok++;
      }
    } else {
      for (int i = y - 1; i <= y + 1; i++) {
        if (a[tmp][i]) ok--;
      }
    }
    if (ok)
      cout << "NO" << '\n';
    else
      cout << "YES" << '\n';
  }
}
int main() {
  solve();
  return 0;
}
