#include <bits/stdc++.h>
using namespace std;
bool dp[3][100010];
set<int> total;
void solve(int qq) {
  int n, q;
  cin >> n >> q;
  for (int i = 0; i < 100010; i++) {
    dp[1][i] = false;
    dp[2][i] = false;
  }
  for (int it = 0; it < q; it++) {
    int r, c;
    cin >> r >> c;
    if (dp[r][c] == true) {
      if (!(dp[3 - r][c] == true && dp[r][c + 1] == true)) {
        total.erase(c);
      }
      if (dp[r][c - 1] == false) {
        total.erase(c - 1);
      }
      dp[r][c] = false;
    } else {
      if (dp[3 - r][c] == true) {
        total.insert(c);
      }
      if (dp[3 - r][c - 1] == true) {
        total.insert(c - 1);
      }
      if (dp[3 - r][c + 1] == true) {
        total.insert(c);
      }
      dp[r][c] = true;
    }
    if (total.empty()) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t;
  t = 1;
  for (int i = 1; i <= t; i++) {
    solve(i);
  }
  return 0;
}
