#include <bits/stdc++.h>
using namespace std;
using pll = pair<long long, long long>;
using vl = vector<long long>;
using vpll = vector<pll>;
using mll = map<long long, long long>;
using mcl = map<char, long long>;
using sl = set<long long>;
using sc = set<char>;
using dl = deque<long long>;
const int N = 1e6 + 5;
long long mod = 1e9 + 7;
vl adj[N];
vpll adjc[N];
long long vis[N];
long long arr[N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long a, b, c, d, sz, n, m, p, x, y, z, i, j, k,
      f = 0, tc, cnt = 0, sum = 0, mul = 1, mi = 1e18, ma = -1e18;
  string str;
  char ch;
  double db;
  long long l, r, q;
  cnt = 0;
  map<pll, long long> mp;
  cin >> n >> q;
  while (q--) {
    cin >> i >> j;
    f = 0;
    if (mp[{i, j}] == 1) {
      f = 1;
    }
    if (i == 2) {
      a = j - 1;
      b = j;
      c = j + 1;
      if (mp[{1, a}])
        if (!f)
          cnt++;
        else
          cnt--;
      if (mp[{1, b}])
        if (!f)
          cnt++;
        else
          cnt--;
      if (mp[{1, c}])
        if (!f)
          cnt++;
        else
          cnt--;
    } else {
      a = j - 1;
      b = j;
      c = j + 1;
      if (mp[{2, a}])
        if (!f)
          cnt++;
        else
          cnt--;
      if (mp[{2, b}])
        if (!f)
          cnt++;
        else
          cnt--;
      if (mp[{2, c}])
        if (!f)
          cnt++;
        else
          cnt--;
    }
    if (mp[{i, j}] == 0)
      mp[{i, j}] = 1;
    else
      mp[{i, j}] = 0;
    if (cnt == 0)
      cout << "Yes\n";
    else
      cout << "No\n";
  }
  return 0;
}
