#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, q;
  scanf("%d%d", &n, &q);
  map<pair<int, int>, int> m1;
  map<pair<int, int>, int> m2;
  for (int i = 1; i <= n; i++) {
    pair<int, int> p(1, i);
    pair<int, int> p1(2, i);
    m1[p] = 0;
    m2[p] = 0;
  }
  int kt = 0, s = 0;
  while (q--) {
    int a, b;
    scanf("%d%d", &a, &b);
    pair<int, int> p(a, b);
    pair<int, int> p1(3 - a, b - 1);
    pair<int, int> p2(3 - a, b);
    pair<int, int> p3(3 - a, b + 1);
    if (m2[p] == 0) {
      m2[p] = 1;
    } else {
      m2[p] = 0;
    }
    if (m2[p] == 0) {
      s -= m1[p];
      if (m2[p1] != 0) {
        m1[p1]--;
      }
      if (m2[p2] != 0) {
        m1[p2]--;
      }
      if (m2[p3] != 0) {
        m1[p3]--;
      }
      m1[p] = 0;
    } else {
      int count = 0;
      if (m2[p1] != 0) {
        m1[p1]++;
        count++;
      }
      if (m2[p2] != 0) {
        m1[p2]++;
        count++;
      }
      if (m2[p3] != 0) {
        m1[p3]++;
        count++;
      }
      m1[p] = count;
      s += count;
    }
    if (s != 0)
      printf("NO\n");
    else
      printf("YES\n");
  }
  return 0;
}
