#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>

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")


/*
  ask S, ~S
  (# edge in S) - (# edge in ~S)
  = (1/2) ((\sum[u \in S] deg(u)) - (\sum[u \in ~S] deg(u)))
  
  deg: K K+1 ... 2K-1 2K 2K ... 2K 2K 2K-1 ... K+1 K
  2K-deg: K K-1 ... 1 0 0 ... 0 0 1 ... K-1 K
  sum = K(K+1)
  (<= K+1) segments with sum <= K in each level
*/

int N, K, Q;

int ask(const string &s) {
  printf("? %s\n", s.c_str());
  fflush(stdout);
  int t;
  scanf("%d", &t);
  return t;
}

int calc(int m) {
  const int resL = ask(string(m, '1') + string(N - m, '0'));
  const int resR = ask(string(m, '0') + string(N - m, '1'));
  return (K*(K+1) + (m - (N-m)) * (2*K) - 2 * (resL - resR)) / 2;
}

vector<int> ans;
void rec(int l, int r, int fL, int fR) {
// cerr<<"[rec] "<<l<<" "<<r<<" "<<fL<<" "<<fR<<endl;
  if (fR - fL >= K) {
    if (l + 1 == r) {
      ans.push_back(l);
    } else {
      const int m = (l + r) / 2;
      const int fM = calc(m);
      rec(l, m, fL, fM);
      rec(m, r, fM, fR);
    }
  }
}

int main() {
  scanf("%d%d%d", &N, &K, &Q);
  rec(0, N, 0, K*(K+1));
  assert((int)ans.size() == 2);
  printf("! %d %d\n", ans[0] + 1, ans[1] + 1);
  fflush(stdout);
  return 0;
}