#include <bits/stdc++.h>
using namespace std;
long long n, t, r, c, lava[3][112345], isfree[112345];
long long func(long long c) {
  if (c == 1) return 2;
  return 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> t;
  long long first = n;
  for (long long i = 1; i <= n; i++) {
    isfree[i] = 1;
  }
  while (t--) {
    cin >> r >> c;
    if (lava[r][c] == 1)
      lava[r][c] = 0;
    else
      lava[r][c] = 1;
    if (lava[r][c] == 1) {
      if (lava[func(r)][c] == 1) {
        if (isfree[c] == 1) {
          isfree[c] = 0;
          first--;
        }
      } else if (c > 1) {
        if (lava[func(r)][c - 1] == 1) {
          if (isfree[c] == 1) {
            isfree[c] = 0;
            first--;
          }
        }
      }
      if (c < n) {
        if (lava[func(r)][c + 1] == 1) {
          if (isfree[c + 1] == 1) {
            isfree[c + 1] = 0;
            first--;
          }
        }
      }
    } else {
      if (c > 1 and lava[r][c - 1] == 0) {
        if (isfree[c] == 0) {
          isfree[c] = 1;
          first++;
        }
      }
      if (c < n and lava[r][c + 1] == 0) {
        if (isfree[c + 1] == 0) {
          isfree[c + 1] = 1;
          first++;
        }
      }
    }
    if (first == n)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  return 0;
}
