#include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265358979323846;
void cp() {}
void solve() {
  long long n, m;
  cin >> n >> m;
  long long a[2][n];
  memset(a, 0, sizeof(a));
  long long flag = 0;
  for (int i = 1; i <= m; i++) {
    long long x, y;
    cin >> x >> y;
    long long cur;
    x--;
    y--;
    cur = (a[x][y] == 0 ? 1 : -1);
    a[x][y] ^= 1;
    for (int j = -1; j <= 1; j++) {
      if (j + y < 0 or j + y > n) continue;
      if (a[1 - x][j + y] == 1) flag += cur;
    }
    if (flag > 0)
      cout << "NO\n";
    else
      cout << "YES\n";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  long long t = 1;
  while (t--) solve();
  return 0;
}
