#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  long long k;
  cin >> n >> k >> m;
  vector<string> f(16);
  f[0] = "0", f[1] = "1";
  for (int i = 2; i < 16; i++) {
    f[i] = f[i - 2] + f[i - 1];
  }
  int n2 = (n < 16) ? n : (14 + (n & 1));
  vector<string> sorted(f[n2].size());
  for (int i = 0; i < f[n2].size(); i++) {
    sorted[i] = f[n2].substr(i, f[n2].size() - i);
  }
  sort(sorted.begin(), sorted.end());
  if (n < 16) {
    cout << sorted[k - 1].substr(0, m) << '\n';
    cin.ignore();
    cin.get();
    return 0;
  }
  vector<long long> fib = {0, 1};
  for (int i = 2; i < n - 8; i++) {
    fib.push_back(min(fib[i - 2] + fib[i - 1], (long long)1e18));
  }
  string last = "";
  int cnt = 0;
  long long s = 0;
  for (int i = 0; i < 400; i++) {
    if (sorted[i] == last) {
      cnt++;
    } else {
      if (n & 1) {
        switch (cnt) {
          case 1:
            s++;
            break;
          case 2:
            s--;
          case 3:
            s += fib[n - 11];
            break;
          case 4:
            s += fib[n - 10] - 1;
            break;
          case 7:
            s += fib[n - 9] - 1;
            break;
        }
      } else if (last.size() < 200) {
        s++;
      } else {
        switch (cnt) {
          case 1:
            s += fib[n - 11] - 1;
            break;
          case 2:
            s--;
          case 3:
            s += fib[n - 10];
            break;
          case 4:
            s += fib[n - 9] - 1;
            break;
        }
      }
      if (s > k) {
        cout << last.substr(0, m) << '\n';
        cin.ignore();
        cin.get();
        return 0;
      }
      last = sorted[i];
      cnt = 1;
    }
  }
}
