#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "URDL";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 998244353) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 998244353) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
int rd(int l, int r) {
  printf("? %d %d\n", l, r);
  fflush(stdout);
  int t;
  scanf("%d", &t);
  if (t == -1) exit(0);
  return t;
}
void fmain(int tid) {
  int t;
  scanf("%d%d", &n, &t);
  vector<int> a(n + 5, 0);
  a[n] = t;
  int pre = 0;
  for (int(i) = 1; (i) <= (int)(n - 1); (i)++) {
    int pt = t, st = t;
    for (int(zz) = 0; (zz) < (int)(16); (zz)++) {
      rd(i + 1, n);
      t = rd(i + 1, n);
      if (t != pt) {
        st = t;
      }
    }
    st -= pt;
    a[i] = (i - st) / 2 - pre;
    pre += a[i] + t - pt;
    a[n] -= a[i];
  }
  printf("! ");
  for (int(i) = 1; (i) <= (int)(n); (i)++) printf("%d", a[i]);
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
