#include <bits/stdc++.h>
using namespace std;
const int N = 303;
int n, t, A[N];
int Query(int l, int r, int last) {
  int nw = last;
  while (nw == last) {
    printf("? %d %d\n", l, r);
    printf("? %d %d\n", l, r);
    fflush(stdout);
    scanf("%d%d", &nw, &nw);
  }
  return (nw);
}
int main() {
  scanf("%d%d", &n, &t);
  if (n % 2 == 0) {
    for (int i = 1; i <= n; i++) {
      int nw = Query(i, i, t);
      if (nw == n - t + 1)
        A[i] = 1;
      else
        A[i] = 0;
      Query(i, i, nw);
    }
  } else {
    int sum = 0;
    for (int i = 1; i <= n - 1; i++) {
      int nw = Query(i, i + 1, t);
      if (nw != n - t)
        A[i + 1] = A[i];
      else
        A[i + 1] = !A[i];
      Query(i, i + 1, nw);
      sum += A[i + 1];
    }
    if (sum != t)
      for (int i = 1; i <= n; i++) A[i] = !A[i];
  }
  printf("! ");
  for (int i = 1; i <= n; i++) printf("%d", A[i]);
  fflush(stdout);
  return (0);
}
