#include <bits/stdc++.h>
using namespace std;
bool compare(const pair<long long, long long>& a,
             const pair<long long, long long>& b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first < b.first;
}
bool sortbysec(const pair<long long, long long>& a,
               const pair<long long, long long>& b) {
  return a.second < b.second;
}
bool isprime(long long n) {
  for (long long i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
signed main() {
  long long t;
  t = 1;
  while (t--) {
    long long n, q;
    cin >> n >> q;
    long long a[2][n];
    for (long long i = 0; i < n; i++) {
      a[0][i] = 0;
      a[1][i] = 0;
    }
    long long bp = 0;
    while (q--) {
      long long x, y;
      cin >> x >> y;
      x--;
      y--;
      if (a[x][y] == 1) {
        a[x][y] = 0;
        for (long long i = -1; i <= 1; i++) {
          if (y + i < 0 || y + i >= n) continue;
          if (a[1 - x][y + i] == 1) bp--;
        }
      } else {
        a[x][y] = 1;
        for (long long i = -1; i <= 1; i++) {
          if (y + i < 0 || y + i >= n) continue;
          if (a[1 - x][y + i] == 1) bp++;
        }
      }
      if (bp != 0)
        cout << "No" << endl;
      else
        cout << "Yes" << endl;
    }
  }
}
