#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v);
template <typename A, typename B>
ostream &operator<<(ostream &cout, pair<A, B> const &p) {
  return cout << "(" << p.first << ", " << p.second << ")";
}
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v) {
  cout << "[";
  for (int i = 0; i < v.size(); i++) {
    if (i) cout << ", ";
    cout << v[i];
  }
  return cout << "]";
}
template <typename A, typename B>
istream &operator>>(istream &cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
mt19937 rng(steady_clock::now().time_since_epoch().count());
void usaco(string filename) {
  freopen((filename + ".in").c_str(), "r", stdin);
  freopen((filename + ".out").c_str(), "w", stdout);
}
const long double pi = 3.14159265358979323846;
const int mod = 1000000007;
long long n, m, k, q, Q, T, l, r, x, y, z;
long long a[1000005];
long long b[1000005];
long long c[1000005];
string second, t;
long long ans = 0;
bool mat[2][100005];
int main() {
  {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
  };
  cin >> n >> q;
  int cnt = 0;
  memset(mat, 0, sizeof(mat));
  for (long long i = 0; i < q; i++) {
    cin >> x >> y;
    --x;
    --y;
    if (mat[x][y]) {
      if (y != 0) cnt -= mat[x ^ 1][y - 1];
      cnt -= mat[x ^ 1][y];
      if (y != n - 1) cnt -= mat[x ^ 1][y + 1];
    } else {
      if (y != 0) cnt += mat[x ^ 1][y - 1];
      cnt += mat[x ^ 1][y];
      if (y != n - 1) cnt += mat[x ^ 1][y + 1];
    }
    mat[x][y] ^= 1;
    cout << (cnt == 0 ? "Yes" : "No") << '\n';
  }
}
