#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 9;
int map1[4][maxn];
int n, q;
int rr[6][2] = {1, 1, 1, 0, -1, 0, 1, -1, -1, 1, -1, -1};
int main() {
  scanf("%d%d", &n, &q);
  int all = 0;
  for (int i = 1; i <= q; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    int flag = 0;
    map1[x][y] ^= 1;
    if (map1[x][y] == 1) {
      if ((x == 1 && y == 1) || (x == 2 && y == n)) {
        flag = 1;
      }
      int sum = 0;
      for (int z = 0; z < 6; ++z) {
        int xx = x + rr[z][0];
        int yy = y + rr[z][1];
        if (xx > 0 && yy > 0 && xx <= 2 && yy <= n) {
          if (map1[xx][yy] == 1) {
            all++;
            sum++;
          }
        }
      }
    } else {
      if ((x == 1 && y == 1) || (x == 2 && y == n)) {
        flag = 0;
      }
      for (int z = 0; z < 6; ++z) {
        int xx = x + rr[z][0];
        int yy = y + rr[z][1];
        if (xx > 0 && yy > 0 && xx <= 2 && yy <= n) {
          if (map1[xx][yy] == 1) {
            all--;
          }
        }
      }
    }
    if (all || flag) {
      printf("No\n");
    } else {
      printf("Yes\n");
    }
  }
  return 0;
}
