#include <bits/stdc++.h>
using namespace std;
int n, t, s[305], k, q, cnt, f, d, t1, t2, p, T, cntp;
void Ask(int first) {
  cout << "? " << first + 1 << ' ' << n << endl;
  cin >> q;
  q = n - q;
  if (q != t) {
    if ((cnt) % 2) {
      if (q - t == t2 - t1 + 1)
        d = -1;
      else
        d = 1;
    } else {
      if (q - t == t1 - t2 + 1)
        d = 1;
      else
        d = -1;
    }
  } else
    cnt++;
  t = n - q;
}
int32_t main() {
  ios_base ::sync_with_stdio(0);
  cin.tie();
  cout.tie();
  cin >> n >> t;
  T = t;
  for (int i = 1; i < n; i++) {
    d = 0;
    for (int j = 1; j <= 33; j++) {
      Ask(i);
      if (d) {
        if (d == 1) {
          t1++;
          if (f % 2)
            s[i] = 1;
          else
            s[i] = 0;
        } else {
          t2++;
          if (f % 2)
            s[i] = 0;
          else
            s[i] = 1;
        }
        break;
      }
    }
    if (!d) {
      if (t1 < t2) {
        t1++;
        if (f % 2)
          s[i] = 1;
        else
          s[i] = 0;
      } else {
        t2++;
        if (f % 2)
          s[i] = 0;
        else
          s[i] = 1;
      }
    } else
      f++;
    T -= s[i];
  }
  s[n] = T;
  cout << "! ";
  for (int i = 1; i <= n; i++) cout << s[i];
  cout << endl;
}
