#include <bits/stdc++.h>
#define rep(i, j, k) for (int i = j; i <= k; i++)
#define per(i, j, k) for (int i = j; i >= k; i--)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ai3 = array<int, 3>;
const int N = 2e5 + 5, mod = 998244353;
struct dsu
{
    vector<int> p, sz, num;
    int n;
    dsu(int n)
    {
        this->n = n;
        p.resize(n + 1, 0);
        sz.resize(n + 1, 0);
        num.resize(n + 1, 0);
        iota(p.begin(), p.end(), 0);
    }
    int find(int x) {return p[x] == x ? x : p[x] = find(p[x]);}
    void merge(int x, int y)
    {
        x = find(x), y = find(y);
        if (x == y)
        {
            num[x] = 1;
            return ;
        }
        p[x] = y, sz[y] += sz[x];
        num[y] |= num[x];
    }
    int siz(int x) {return sz[find(x)];}
    int cnt(int x) {return num[find(x)];}
    bool same(int x, int y) {return find(x) == find(y);}
};
int main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    int n, m;
    cin >> n >> m;
    dsu ds(n + m);
    vector<int> id(n + m + 1);
    rep(i, 1, n) id[i] = i;
    rep(i, 1, n) ds.sz[i] = 1;
    int tot = n;
    while (m--)
    {
        char op;
        cin >> op;
        if (op == '?')
        {
            int x;
            cin >> x;
            x = id[x];
            if (ds.siz(x) == 1) cout << ds.cnt(x);
            else cout << (ds.cnt(x) ? "1" : "?");
        }
        if (op == '+')
        {
            int x, y;
            cin >> x >> y;
            x = id[x], y = id[y];
            ds.merge(x, y);
        }
        if (op == '-')
        {
            int x;
            cin >> x;
            int fx = ds.find(id[x]);
            ds.sz[fx]--;
            id[x] = ++tot;
            ds.sz[tot]++;
        }
    }
    return 0;
}