#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long N = 1001;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  int n, q;
  cin >> n >> q;
  vector<vector<bool>> free(2, vector<bool>(n, true));
  set<pair<pair<int, int>, pair<int, int>>> blocks;
  while (q--) {
    int r, c;
    cin >> r >> c;
    r--, c--;
    if (free[r][c]) {
      for (int i = -1; i < 2; i++) {
        if (c + i < n and c + i >= 0 and !free[1 - r][c + i]) {
          blocks.insert({{r, c}, {1 - r, c + i}});
          blocks.insert({{1 - r, c + i}, {r, c}});
        }
      }
      free[r][c] = false;
    } else {
      for (int i = -1; i < 2; i++) {
        if (c + i < n and c + i >= 0 and !free[1 - r][c + i]) {
          blocks.erase({{r, c}, {1 - r, c + i}});
          blocks.erase({{1 - r, c + i}, {r, c}});
        }
      }
      free[r][c] = true;
    }
    cout << ((int)blocks.size() ? "no" : "yes") << '\n';
  }
}
