#include <bits/stdc++.h>
using namespace std;
constexpr int kN = int(2E5 + 10);
vector<pair<int, int>> graph[3][kN];
bool have[3][kN];
int main() {
  int n, q, x, y, cnt = 0;
  scanf("%d%d", &n, &q);
  for (int i = 1; i <= n; i++) {
    graph[1][i].push_back({2, i});
    graph[2][i].push_back({1, i});
    if (i != 1) {
      graph[1][i].push_back({2, i - 1});
      graph[2][i - 1].push_back({1, i});
    }
    if (i != n) {
      graph[1][i].push_back({2, i + 1});
      graph[2][i + 1].push_back({1, i});
    }
  }
  for (int i = 1; i <= q; i++) {
    scanf("%d%d", &x, &y);
    if (have[x][y]) {
      have[x][y] = false;
      for (pair<int, int> j : graph[x][y])
        if (have[j.first][j.second]) cnt--;
    } else {
      have[x][y] = true;
      for (pair<int, int> j : graph[x][y])
        if (have[j.first][j.second]) cnt++;
    }
    if (cnt)
      printf("No\n");
    else
      printf("Yes\n");
  }
}
