View Code of Problem 3876

// 巨菜的ACMer

#include <bits/stdc++.h>

using namespace std;

//-----
typedef double db;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pw(x) (1ll << (x))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define rep(i, l, r) for(int i=(l);i<(r);++i)
#define per(i, l, r) for(int i=(r)-1;i>=(l);--i)
#define sf(x) scanf("%d", &(x))

const int N = int(5e6 + 5);
bitset<N> p;
const char str[2][5] = {
        "No",
        "Yes"
};

int main() {
    ios_base::sync_with_stdio(false);
    int n, q;
    p.flip();
    cin >> n >> q;
    rep(i, 0, q) {
        char a;
        unsigned int b;
        cin >> a >> b;
        if (a == 'C') {
            p.flip(b);
        } else {
            puts(str[p[b]]);
        }
    }
    return 0;
}