#include <bits/stdc++.h>
using namespace std;
float PHI = 1.6180339;
const float PI_F = 3.14159265358979f;
bool isPrime(long long n) {
  if (n <= 1) return true;
  for (long long i = 2; i < n; i++)
    if (n % i == 0) return false;
  return true;
}
long long modpow(long long x, long long n, long long m) {
  if (n == 0) return 1 % m;
  long long u = modpow(x, n / 2, m);
  u = (u * u) % m;
  if (n % 2 == 1) u = (u * x) % m;
  return u;
}
bool sortinrev(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.first > b.first);
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie();
  cout.tie();
  cout << fixed << setprecision(12);
  long long n, q;
  cin >> n >> q;
  long long arr1[n + 10];
  long long arr2[n + 10];
  for (long long i = 1; i <= n; i++) {
    arr1[i] = 0;
    arr2[i] = 0;
  }
  long long shock = 0;
  for (long long i = 0; i < q; i++) {
    long long a, b;
    cin >> a >> b;
    if (a == 1) {
      if (arr1[b] == 0) {
        arr1[b] = 1;
        if (arr2[b] == 1) {
          ++shock;
        }
        if (arr2[b - 1] == 1) {
          ++shock;
        }
        if (arr2[b + 1] == 1) {
          ++shock;
        }
      } else {
        arr1[b] = 0;
        if (arr2[b] == 1) {
          --shock;
        }
        if (arr2[b - 1] == 1) {
          --shock;
        }
        if (arr2[b + 1] == 1) {
          --shock;
        }
      }
    } else if (a == 2) {
      if (arr2[b] == 0) {
        arr2[b] = 1;
        if (arr1[b] == 1) {
          ++shock;
        }
        if (arr1[b - 1] == 1) {
          ++shock;
        }
        if (arr1[b + 1] == 1) {
          ++shock;
        }
      } else {
        arr2[b] = 0;
        if (arr1[b] == 1) {
          --shock;
        }
        if (arr1[b - 1] == 1) {
          --shock;
        }
        if (arr1[b + 1] == 1) {
          --shock;
        }
      }
    }
    if (shock == 0)
      cout << "Yes"
           << "\n";
    else
      cout << "No"
           << "\n";
  }
  return 0;
}
