#include <bits/stdc++.h>
using namespace std;
const int N = 1E5 + 7;
int dp[3][N];
int main() {
  int n, m;
  cin >> n >> m;
  int flag = 0;
  for (int i = 1; i <= m; i++) {
    int x, y;
    cin >> x >> y;
    if (dp[x][y]) {
      int x1 = x;
      if (x == 1)
        x1++;
      else
        x1--;
      if (dp[x1][y]) flag--;
      if (dp[x1][y + 1]) flag--;
      if (dp[x1][y - 1]) flag--;
      dp[x][y] = 0;
      if (flag >= 1)
        cout << "NO" << endl;
      else
        cout << "YES" << endl;
    } else {
      int x1 = x;
      if (x == 1)
        x1++;
      else
        x1--;
      if (dp[x1][y]) flag++;
      if (dp[x1][y + 1]) flag++;
      if (dp[x1][y - 1]) flag++;
      dp[x][y] = 1;
      if (flag >= 1)
        cout << "NO" << endl;
      else
        cout << "YES" << endl;
    }
  }
  return 0;
}
