#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, q;
  cin >> n >> q;
  set<pair<int, int>> s;
  map<pair<int, int>, set<pair<int, int>>> prob;
  pair<int, int> x = make_pair(2, n);
  for (int i = 0; i < q; i++) {
    int r, c;
    cin >> r >> c;
    pair<int, int> p = make_pair(r, c);
    if (s.count(p)) {
      s.erase(p);
      if (r == 1) {
        prob.erase(p);
      } else {
        auto it = prob.find(make_pair(1, c));
        if (it != prob.end()) {
          it->second.erase(p);
          if (it->second.empty()) {
            prob.erase(it);
          }
        }
        it = prob.find(make_pair(1, c + 1));
        if (it != prob.end()) {
          it->second.erase(p);
          if (it->second.empty()) {
            prob.erase(it);
          }
        }
        it = prob.find(make_pair(1, c - 1));
        if (it != prob.end()) {
          it->second.erase(p);
          if (it->second.empty()) {
            prob.erase(it);
          }
        }
      }
    } else {
      s.insert(p);
      if (r == 1) {
        if (s.count(make_pair(2, c))) {
          prob[p].insert(make_pair(2, c));
        }
        if (s.count(make_pair(2, c - 1))) {
          prob[p].insert(make_pair(2, c - 1));
        }
        if (s.count(make_pair(2, c + 1))) {
          prob[p].insert(make_pair(2, c + 1));
        }
      } else {
        if (s.count(make_pair(1, c))) {
          prob[make_pair(1, c)].insert(p);
        }
        if (s.count(make_pair(1, c - 1))) {
          prob[make_pair(1, c - 1)].insert(p);
        }
        if (s.count(make_pair(1, c + 1))) {
          prob[make_pair(1, c + 1)].insert(p);
        }
      }
    }
    if (prob.empty() && !s.count(x)) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
}
