#include <bits/stdc++.h>
using namespace std;
long long c[3][100005], a1[100005], a2[100005], a3[100005];
long long calc[100005];
long long solve() {
  long long n, q;
  cin >> n >> q;
  long long debris = 0;
  while (q--) {
    long long t1, t2;
    cin >> t1 >> t2;
    if (c[t1][t2]) {
      if (t1 == 1) {
        if (c[1][t2] && c[2][t2]) debris--;
        if (c[1][t2] && c[2][t2 + 1] && t2 + 1 <= n) debris--;
        if (c[1][t2] && c[2][t2 - 1] && t2 - 1 >= 1) debris--;
      } else {
        if (c[2][t2] && c[1][t2]) debris--;
        if (c[2][t2] && c[1][t2 + 1] && t2 + 1 <= n) debris--;
        if (c[2][t2] && c[1][t2 - 1] && t2 - 1 >= 1) debris--;
      }
      c[t1][t2] = 0;
    } else {
      c[t1][t2] = 1;
      if (t1 == 1) {
        if (c[1][t2] && c[2][t2]) debris++;
        if (c[1][t2] && c[2][t2 + 1] && t2 + 1 <= n) debris++;
        if (c[1][t2] && c[2][t2 - 1] && t2 - 1 >= 1) debris++;
      } else {
        if (c[2][t2] && c[1][t2]) debris++;
        if (c[2][t2] && c[1][t2 + 1] && t2 + 1 <= n) debris++;
        if (c[2][t2] && c[1][t2 - 1] && t2 - 1 >= 1) debris++;
      }
    }
    if (!debris)
      cout << "Yes\n";
    else
      cout << "No\n";
  }
  return 0;
}
signed main() {
  ios::sync_with_stdio(0);
  long long t = 1;
  while (t--) solve();
  return 0;
}
