#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma warning(disable : 4996)
using namespace std;
const long long INF = 2147483647;
const double PI = acos(-1);
const int mod = 1e9 + 7;
bool vis[3][120000];
int main() {
  long long n, q;
  cin >> n >> q;
  long long obstacles = 0;
  for (int j = 1; j <= q; j++) {
    long long x, y;
    cin >> x >> y;
    long long increment = vis[x][y] == 1 ? -1 : 1;
    vis[x][y] = 1 - vis[x][y];
    long long dx = x == 2 ? 1 : 2;
    for (int i = -1; i <= 1; i++) {
      if (vis[dx][y + i]) obstacles += increment;
    }
    if (obstacles)
      cout << "No" << endl;
    else
      cout << "Yes" << endl;
  }
  return 0;
}
