#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
const int MOD = 1000000007;
const int MAMOD = 998244353;
const int INF = 0x3f3f3f3f;
const long long LLINF = 0x3f3f3f3f3f3f3f3f;
int Map[3][MAXN];
int n, q;
int main() {
  cin >> n >> q;
  int ok = 0, x, y;
  while (q--) {
    cin >> x >> y;
    Map[x][y] ^= 1;
    if (Map[x][y] && (Map[x ^ 3][y] || Map[x ^ 3][y - 1] || Map[x ^ 3][y + 1]))
      ok += Map[x ^ 3][y] + Map[x ^ 3][y - 1] + Map[x ^ 3][y + 1];
    else if (Map[x ^ 3][y] || Map[x ^ 3][y - 1] || Map[x ^ 3][y + 1])
      ok -= Map[x ^ 3][y] + Map[x ^ 3][y - 1] + Map[x ^ 3][y + 1];
    if (!ok)
      cout << "Yes\n";
    else
      cout << "No\n";
  }
  return 0;
}
