#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, q;
  cin >> n >> q;
  int blc = 0;
  map<int, bool> up;
  map<int, bool> dow;
  while (q--) {
    int r, c;
    cin >> r >> c;
    if (r == 1) {
      if (dow.count(c)) {
        dow.erase(c);
        for (int b = c - 1; b <= c + 1; b++) {
          if (up.count(b)) {
            blc--;
          }
        }
        if (blc) {
          cout << "No\n";
        } else {
          cout << "Yes\n";
        }
      } else {
        dow[c] = true;
        for (int b = c - 1; b <= c + 1; b++) {
          if (up.count(b)) {
            blc++;
          }
        }
        if (blc) {
          cout << "No\n";
        } else {
          cout << "Yes\n";
        }
      }
    } else {
      if (up.count(c)) {
        up.erase(c);
        for (int b = c - 1; b <= c + 1; b++) {
          if (dow.count(b)) {
            blc--;
          }
        }
        if (blc) {
          cout << "No\n";
        } else {
          cout << "Yes\n";
        }
      } else {
        up[c] = true;
        for (int b = c - 1; b <= c + 1; b++) {
          if (dow.count(b)) {
            blc++;
          }
        }
        if (blc) {
          cout << "No\n";
        } else {
          cout << "Yes\n";
        }
      }
    }
  }
  return 0;
}
