// Modernizacja Bajtocji - 2024 Potyczki Algorytmiczne
#include <bits/stdc++.h>
using namespace std;
map <int, set <int>> zbiory;
#define PC -1

int ile=0;

int find(vector<int> &tab, int a)
{
    if(tab[a] == a) return a;
    
    int ret = find(tab, tab[a]);
    tab[a] = ret;
    return ret;
}

void print_tab(string name, set<int> a)
{
    cerr << endl << name << ' ';
    for(auto x : a)
    {
        cerr << " " << x;
    }
    cerr << endl << endl;
}

int main ()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, q, a, b;

    cin >> n >> q;
    
    vector <int> tab(n+1);
    // vector <int> tab = {0, 1, 1, 2, 3, 3, 4, 4, 5};

    // cout << find(tab, 8);

    // for(auto x : tab)
    // {
    //     cout << x;
    // }

    for(int i = 0; i < q; ++i)
    {
        char operacja;        
        cin >> operacja;
        
        // cerr << endl << operacja << '-' << i << '\t';
        // for(auto x : tab)
        // {
        //     cerr << x << '\t';
        // }
        //cerr << endl;
        //print_tab("zbiory[2] ", zbiory[2]);


        if(operacja == '+')
        {
            cin >> a >> b;
            //cerr << a << ' ' << b << endl;

            if(a == b)
            {
              
                if(tab[a] > 0)
                {
                    int rep = find(tab, a);
                    for(auto x : zbiory[rep])
                    {
                        tab[x] = PC;
                    }
                    zbiory[rep].clear();
                    
                }
                else
                {
                    tab[a] = PC;
                }
                continue;
            }

            if(tab[a] == 0 && tab[b] == 0)
            {
                tab[a] = a;
                tab[b] = a;
                zbiory[a].insert(b);
                zbiory[a].insert(a);
                continue;
            }
            else if((tab[a] > 0 && tab[b] == 0) or (tab[a] == 0 && tab[b] > 0))
            {   //if zero is in a and b is in zbiory
                if(tab[a] > 0)
                {
                    swap(a,b);
                }// a in now 0
                int rep = find(tab, b);
                tab[a] = rep;
                zbiory[rep].insert(a);
                continue;
            }
            else if((tab[a] > 0 && tab[b] == PC) or (tab[a] == PC && tab[b] > 0))
            {
                if(tab[a] == PC)
                {
                    swap(a,b);
                }
                int rep = find(tab, a);
                for(auto x : zbiory[rep])
                {
                    tab[x] = PC;
                }
                zbiory[rep].clear();
                continue;
            }
            else if((tab[a] == PC && tab[b] == 0) or (tab[a] == 0 && tab[b] == PC))
            {
                if(tab[a] == 0)
                {
                    tab[a] = PC;
                }
                else
                {
                    tab[b] = PC;
                }
                continue;
            }
            else if(tab[a] > 0 && tab[b] > 0)
            {
                int repa, repb;
                repa = find(tab, a);
                repb = find(tab, b);
                //cerr << endl << "repa: " << repa << "tab[repa]: " << tab[repa] << "repb: " << repb << "tab[repb]: " << tab[repb] << endl;                
                if(repa != repb)
                {//join

                    //cerr << endl << "repa: " << repa << "tab[repa]: " << tab[repa] << "repb: " << repb << "tab[repb]: " << tab[repb] << endl;                
                    //tab[repb] = repa;
                    //print_tab("zbiory[repa] ", zbiory[repa]);
                    //print_tab("zbiory[repb] ", zbiory[repb]);
                    
                    zbiory[repb].insert(zbiory[repa].begin(), zbiory[repa].end());
                    for(auto x : zbiory[repa])
                    {
                        tab[x] = repb;
                    }
                    zbiory[repa].clear();

                }
                else
                {//collection contains PC - connecting withi the same collection



                    for(auto x : zbiory[repa])
                    {
                        tab[x] = PC;
                    }
                    zbiory[repa].clear();
                    for(auto x : zbiory[repb])
                    {
                        tab[x] = PC;
                    }
                    zbiory[repb].clear();
                }
            }
            continue;
            //cerr << '+';

        }
        else if(operacja == '-')
        {
            cin >> a;
            //cerr << a << ' ' << endl;
            //string s = "****a";

            if(tab[a] == PC)
            {
                //s+="PC";
                tab[a] = 0;
                continue;
            }

            int repa = find(tab, a);
            zbiory[repa].erase(a);
            
            if(a == repa)
            {
                //s+="tab[a]==repa";
             
                if(zbiory[repa].size()>1)
                {
                    int newrep = *(zbiory[repa].begin());
                    
                    zbiory[newrep].insert(zbiory[repa].begin(), zbiory[repa].end());
                    for(auto x : zbiory[repa])
                    {
                        tab[x] = newrep;
                    }
                    zbiory[repa].clear();                   

                }
                else if(zbiory[repa].size() == 1)
                {
                    int first = *(zbiory[repa].begin());
                    tab[first] = 0;
                    zbiory[repa].clear();                   
                }
               
            }
            else
            {
                //s+="else-tab[a]==repa";
                if(zbiory[repa].size() == 1)
                {
                    int first = *(zbiory[repa].begin());
                    tab[first] = 0;
                    zbiory[repa].clear();                   
                }

            }
            //cerr << endl << tab[a] << ' ' << a << endl;
            tab[a] = 0;
            //cerr << s;
            continue;
            
        }
        else if(operacja == '?')
        {
            
            cin >> a;
            //cerr << a << " *** "<< ++ile << ' ' << endl;
            if(tab[a] > 0)
            {
                cout << '?';
            }
            else if(tab[a] == 0)
            {
                cout << '0';
            }
            else
            {
                cout << '1';
            }
            //cerr << '?';
        }
    }
    cout << endl;
    return 0;
}