#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
map<pair<int, int>, int> mp;
int n, q;
int num;
int main() {
  cin >> n >> q;
  for (int i = 1, x, y; i <= q; i++) {
    scanf("%d%d", &x, &y);
    if (x == 2) x = 0;
    mp[{x, y}]++;
    if (mp[{x, y}] % 2 == 1) {
      if (mp[{x ^ 1, y - 1}] % 2 || mp[{x ^ 1, y}] % 2 ||
          mp[{x ^ 1, y + 1}] % 2) {
        puts("NO");
        if (mp[{x ^ 1, y - 1}] % 2) num++;
        if (mp[{x ^ 1, y}] % 2) num++;
        if (mp[{x ^ 1, y + 1}] % 2) num++;
      } else {
        if (num)
          puts("NO");
        else
          puts("YES");
      }
    } else {
      if (mp[{x ^ 1, y + 1}] % 2 || mp[{x ^ 1, y}] % 2 ||
          mp[{x ^ 1, y - 1}] % 2) {
        if (mp[{x ^ 1, y + 1}] % 2) num--;
        if (mp[{x ^ 1, y}] % 2) num--;
        if (mp[{x ^ 1, y - 1}] % 2) num--;
      }
      if (num == 0)
        puts("YES");
      else
        puts("NO");
    }
  }
  return 0;
}
