#include <bits/stdc++.h>
using namespace std;
mt19937_64 rang(
    chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
  uniform_int_distribution<int> uid(0, lim - 1);
  return uid(rang);
}
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
void solve() {
  int n, q;
  cin >> n >> q;
  int a[2][n];
  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < n; j++) a[i][j] = 1;
  }
  int cnt = 0;
  while (q--) {
    int x, y;
    cin >> x >> y;
    x -= 1, y -= 1;
    a[x][y] ^= 1;
    if (a[x][y] == 0) {
      if (y - 1 >= 0 and a[x ^ 1][y - 1] == 0) cnt++;
      if (a[x ^ 1][y] == 0) cnt++;
      if (y + 1 < n and a[x ^ 1][y + 1] == 0) cnt++;
    } else {
      if (y - 1 >= 0 and a[x ^ 1][y - 1] == 0) cnt--;
      if (a[x ^ 1][y] == 0) cnt--;
      if (y + 1 < n and a[x ^ 1][y + 1] == 0) cnt--;
    }
    if (cnt >= 1)
      cout << "No\n";
    else
      cout << "Yes\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  srand(chrono::high_resolution_clock::now().time_since_epoch().count());
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
