#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int)1e9 + 23111992;
const long long LINF = (long long)1e18 + 23111992;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline unsigned long long isqrt(unsigned long long k) {
  unsigned long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int myrand() { return abs((int)mt()); }
int ask(int l, int r) {
  cout << "? " << l + 1 << " " << r + 1 << "\n";
  cout.flush();
  int res;
  cin >> res;
  return res;
}
void chemthan() {
  int n, t;
  cin >> n >> t;
  int tmp = t;
  static int res[1000];
  for (int i = (0); i < (n - 1); ++i) {
    for (int it = (0); it < (33 + 1); ++it) {
      int nt = ask(i + 1, n - 1);
      if (nt != n - t || it == 33) {
        if (!(it & 1)) {
          int x = (n - i - 1 + (t - nt)) / 2;
          res[i] = tmp - x;
        } else {
          int x = (n - i - 1 - (t - nt)) / 2;
          res[i] = tmp - x;
        }
        t = nt;
        if (!(it & 1)) {
          t = ask(i + 1, n - 1);
        }
        break;
      } else {
        t = nt;
      }
    }
    tmp -= res[i];
  }
  res[n - 1] = tmp;
  cout << "! ";
  for (int i = (0); i < (n); ++i) cout << res[i];
  cout << "\n";
}
int main(int argc, char* argv[]) {
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
