#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#pragma GCC target("avx2")

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


// [0, E), [E, F), [F, 32)
constexpr int E = 6;
constexpr int F = 21;
constexpr unsigned MASK_A = (1U << E) - 1U;
constexpr unsigned MASK_B = (1U << F) - (1U << E);
constexpr unsigned MASK_C = 0U - (1U << F);

int N, Q;
unsigned long long zs[1 << 26];

int main() {
  unsigned long long pre[1 << E] = {};
  for (int a = 0; a < 1 << E; ++a) for (int b = 0; b < 1 << E; ++b) if (!(a & ~b)) {
    pre[a] |= 1ULL << b;
  }
  
  scanf("%d%d", &N, &Q);
  
  for (int q = 0; q < Q; ++q) {
    char O;
    unsigned I;
    scanf(" %c%u", &O, &I);
    
    const unsigned A = (I & MASK_A);
    const unsigned B = (I & MASK_B) >> E;
    const unsigned C = (I & MASK_C) >> E;
    if (O == '!') {
      // superset of B
      for (unsigned b = B; b < 1U << (F - E); ++b |= B) {
        zs[b | C] ^= pre[A];
      }
    } else {
      unsigned long long ans = 0;
      // subset of C
      for (unsigned c = C; ; (c -= 1U << (F - E)) &= C) {
        ans ^= zs[B | c];
        if (!c) break;
      }
      ans = ans >> A & 1;
      printf("%llu\n", ans);
    }
  }
  return 0;
}