#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>

using namespace std;

typedef long long ll;


void solve() {
    int n, q;
    cin >> n >> q;
    vector < vector<bool>> a(3, vector<bool>(n + 1));
    int ans = 0;
    for (int i = 0; i < q; ++i) {
        int r, c;
        cin >> r >> c;
        --r;
        int x = (a[r][c] ? -1 : 1);
        a[r][c] = !a[r][c];
        for (int i = -1; i <= 1; ++i) {
            if (i + c <= 0 || i + c > n)
                continue;
            if (a[(r + 1) % 2][i + c]) {
                ans += x;
            }
        }
        cout << ((ans > 0) ? "No\n" : "Yes\n");

    }
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
}