1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define INF 1000000000
#define INFl 1000000000000000000
#define all(x) x.begin(), x.end()
#define sajz(x) (int)x.size()
#define pb push_back
#define se second
#define fi first
#define yes puts("YES")
#define no puts("NO")
#define erase_duplicates(x) {sort(all(x));(x).resize(distance((x).begin(), unique(all(x))));}
using namespace std;
//using namespace __gnu_pbds;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

//#define int ll

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef set<int> si;
typedef multiset<int> msi;
typedef long double ld;
//typedef cc_hash_table<int, int, hash<int>> ht;

const int Q = 1e6 + 5;
const int N = 3e5 + 5 + Q;

int id[N];
set<int> S[N];
int uf[N], a[N]; 

int Find(int x) {
    if (uf[x] == x) return x;
    uf[x] = Find(uf[x]);
    return uf[x];
}

void Union(int A, int B) {
    int sa = Find(A);
    int sb = Find(B);

    if (sajz(S[sa]) < sajz(S[sb])) {
        uf[sa] = sb;
        for (auto it : S[sa]) S[sb].insert(it);
        S[sa].clear();
    } else {
        uf[sb] = sa;
        for (auto it : S[sb]) S[sa].insert(it);
        S[sb].clear();
    }
}

void ans(int v) {
    if (a[v] == 2) cout << '?';
    else cout << a[v];
}

int32_t main() {
	ios_base::sync_with_stdio(false);
	cout.tie(0);
	cin.tie(0);

    int n, q;
    cin >> n >> q;

    for (int i = 1; i <= n + q + 5; i ++) {
        uf[i] = i;
        S[i].insert(i);
        a[i] = 0;
    }

    for (int i = 1; i <= n; i ++) id[i] = i;

    int mx = n;

    while (q--) {
        char op;
        cin >> op;

        if (op == '?') {
            int v;
            cin >> v;
            v = id[v];
            ans(v);
        } else if (op == '+') {
            int u, v;
            cin >> u >> v;
			
            u = id[u], v = id[v];

            assert(a[u]!=1 || a[v]!=1);

            int su = Find(u), sv = Find(v);

            if (su != sv && a[u] != 1 && a[v] != 1) {
                a[u] = 2;
                a[v] = 2;
                Union(u, v);
            } else {
                if (a[u] == 1) su = sv;
                for (auto it : S[su]) {
                    if (it != su);
                    a[it] = 1;
                    uf[it] = it;
                    S[it].insert(it);
                }
                S[su].clear();
                a[su] = 1;
                uf[su] = su;
                S[su].insert(su);
            }
        } else {
            int v;
            cin >> v;
            int V = v;
            v = id[v];

            a[v] = 0;
            int sv = Find(v);

            if (sajz(S[sv]) == 1) continue;

            S[sv].erase(v);

            int cand = *S[sv].begin();

            if (sajz(S[sv]) == 1) {
                a[cand] = 0;
                S[sv].erase(cand);
                uf[cand] = cand;
                S[cand].insert(cand);
            }

            id[V] = ++mx;
            v = id[V];

            a[v] = 0;
            uf[v] = v;
            S[v].insert(v);
        }
    }

    cout << '\n';
    return 0;
}