#include <bits/stdc++.h>
using namespace std;
int mod = (int)1e9 + 7;
int main() {
  int n, q;
  cin >> n >> q;
  vector<vector<int> > a(2, vector<int>(n));
  int bad = 0;
  int row, column;
  while (q--) {
    cin >> row >> column;
    row--;
    column--;
    int count = 0, adj = (row + 1) % 2;
    for (int i = max(0, column - 1); i <= min(n - 1, column + 1); i++)
      count += (a[adj][i] == 1);
    if (a[row][column] == 1) {
      bad -= count;
      a[row][column] = 0;
    } else {
      bad += count;
      a[row][column] = 1;
    }
    if (bad > 0)
      cout << "No\n";
    else
      cout << "Yes\n";
  }
  return 0;
}
