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
#pragma GCC optimize("Ofast")
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
//typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define pss pair<short,short>
#define pld pair<long double,long double >
#define ld long double
#define piii  pair<pii,int>
#define vii vector<pair<int,int> >
#define st first
#define nd second
#define pll pair<ll,ll>
#define speed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define M_PI 3.14159265358979323846
//#define int long long
//const int mod=1000000007;
//const int mod=1009;
const int mod=998244353;
const int inf=1000000009;
const long long INF=1000000000000000009;
const long long big=1000000000000000;
const long double eps=0.000000000000000000001;
const int rozmiar=2e6+5;
vi Z[rozmiar];
int R[rozmiar],K[rozmiar],S[rozmiar];
void kazdy_ma_kompa(int numer){
    for(auto el:Z[numer]){
        if(R[el]==numer){
            K[el]=1;
        }
    }
    Z[numer].clear();
    S[numer]=0;
}
void Union(int a,int b){
    if(Z[a].size()<Z[b].size())
        swap(a,b);
    for(auto el:Z[b]){
        if(R[el]==b){
            R[el]=a;
            Z[a].pb(el);
        }
    }
    S[a]+=S[b];
    Z[b].clear();
}
int nr=0;
void solve()
{
    int n,q;
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        nr++;
        R[i]=nr;
        Z[nr].pb(i);
        S[nr]=1;
    }
    for(int i=1;i<=q;i++){
        char c;
        int a,b;
        cin>>c;
        if(c=='+'){
            cin>>a>>b;
            if(K[b])
                swap(a,b);
            if(K[a]){
                kazdy_ma_kompa(R[b]);
            }
            else{
                //cout<<"echo "<<a<<" "<<b<<" "<<R[a]<<" "<<R[b]<<" "<<R[4]<<"\n";
                if(R[a]==R[b]){
                    kazdy_ma_kompa(R[a]);
                }
                else{
                    Union(R[a],R[b]);
                }
            }
        }
        else if(c=='-'){
            cin>>a;
            K[a]=0;
            nr++;
            S[R[a]]--;
            R[a]=nr;
            S[nr]=1;
            Z[nr].pb(a);
        }
        else{
            cin>>a;
            if(K[a])
                cout<<"1";
            else if(S[R[a]]>1)
                cout<<"?";
            else
                cout<<"0";
        }
        //cout<<i<<" siema "<<K[4]<<" "<<R[4]<<" "<<R[3]<<"\n";
    }

}
    
int32_t main(){
    speed
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}