#include <bits/stdc++.h>
using namespace std;
long long int pw(long long int a, long long int b, long long int mod) {
  if (!b) return 1;
  if (b & 1) return a * pw(a * a % mod, b / 2, mod) % mod;
  return pw(a * a % mod, b / 2, mod) % mod;
}
const long long int MAXN = 1e5 + 10;
const long long int INF = 8e18;
const long long int MOD = 1e9 + 7;
int n, q, A[MAXN], cnt;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  fill(A, A + MAXN, 3);
  cin >> n >> q;
  while (q--) {
    int r, c;
    cin >> r >> c;
    r--;
    if (c < n) {
      cnt -= (A[c] & A[c + 1]) == 0;
      cnt += ((A[c] ^ (1 << r)) & A[c + 1]) == 0;
    }
    if (c > 1) {
      cnt -= (A[c] & A[c - 1]) == 0;
      cnt += ((A[c] ^ (1 << r)) & A[c - 1]) == 0;
    }
    A[c] ^= (1 << r);
    cout << (cnt > 0 ? "No" : "Yes") << '\n';
  }
  return 0;
}
