#include <bits/stdc++.h>
using namespace std;
int ma[5][200010];
int main() {
  int n, q;
  cin >> n >> q;
  int r = 0;
  for (int i = 0; i < q; i++) {
    int a, b;
    cin >> a >> b;
    if (ma[a][b] == 0) {
      ma[a][b] = 1;
      if (a == 1) {
        if (ma[a + 1][b] == 1) r++;
        if (b + 1 <= n) {
          if (ma[a + 1][b + 1] == 1) r++;
        }
        if (b - 1 >= 1) {
          if (ma[a + 1][b - 1] == 1) r++;
        }
      } else {
        if (ma[a - 1][b] == 1) r++;
        if (ma[a - 1][b - 1] == 1) r++;
        if (ma[a - 1][b + 1] == 1) r++;
      }
    } else if (ma[a][b] == 1) {
      ma[a][b] = 0;
      if (a == 1) {
        if (ma[a + 1][b] == 1) r--;
        if (b + 1 <= n) {
          if (ma[a + 1][b + 1] == 1) r--;
        }
        if (b - 1 >= 1) {
          if (ma[a + 1][b - 1] == 1 and b - 1 >= 1) r--;
        }
      } else {
        if (ma[a - 1][b] == 1) r--;
        if (b + 1 <= n) {
          if (ma[a - 1][b + 1] == 1 and b + 1 <= n) r--;
        }
        if (b - 1 >= 1) {
          if (ma[a - 1][b - 1] == 1 and b - 1 >= 1) r--;
        }
      }
    }
    if (r == 0)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
}
