#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
inline ll randint(ll a, ll b) {
  ll w = (_g() << 31LL) ^ _g();
  return a + w % (b - a + 1);
}
inline void fast_io() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
};
template <typename T>
inline T sign(T x) {
  return T(x > 0) - T(x < 0);
}
template <typename T, typename S>
inline ostream& operator<<(ostream& os, const pair<T, S> p) {
  cout << "[" << p.first << ";" << p.second << "]";
  return os;
}
template <typename T>
inline ostream& operator<<(ostream& os, const vector<T>& v) {
  for (auto el : v) cout << el << " ";
  return os;
}
template <typename T>
inline T fetch() {
  T ret;
  cin >> ret;
  return ret;
}
template <typename T>
inline vector<T> fetch_vec(int sz) {
  vector<T> ret(sz);
  for (auto& elem : ret) cin >> elem;
  return ret;
}
const int MAXN = (int)1e5 + 7;
int a[2][MAXN];
int n, q;
int cnt = 0;
void upd(int c, int s) {
  int dlt = 0;
  for (int j = max(0, c - 3); j <= min(n - 1, c + 3); ++j) {
    dlt += a[0][j] && a[1][j];
    if (j != 0) {
      dlt += a[0][j - 1] && a[1][j];
      dlt += a[0][j] && a[1][j - 1];
    }
  }
  cnt += dlt * s;
}
void solve() {
  cin >> n >> q;
  while (q--) {
    int r = fetch<int>() - 1;
    int c = fetch<int>() - 1;
    upd(c, -1);
    a[r][c] ^= 1;
    upd(c, +1);
    cout << (cnt > 0 ? "No\n" : "Yes\n");
  }
}
int main() {
  fast_io();
  solve();
  return 0;
}
