#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
const long long INF = 2e18;
const int N = 205;
int a[N][2], fb[N][N], p[N];
long long fbc[N][N];
int n, m;
long long k;
vector<int> v;
long long getCount() {
  memset(a, 0, sizeof(a));
  memset(fb, 0, sizeof(fb));
  memset(fbc, 0, sizeof(fbc));
  v.push_back(2);
  int len = v.size() - 1;
  a[0][v[0]] = 1;
  for (int i = 1; i <= len; i++) {
    p[i] = a[p[i - 1]][v[i]];
    for (int j = 0; j < 2; j++) {
      a[i][j] = v[i] == j ? i + 1 : a[p[i - 1]][j];
    }
  }
  for (int i = 0; i <= len; i++) {
    for (int j = 0; j < 2; j++) {
      fb[i][j] = a[i][j];
      if (fb[i][j] == len) fbc[i][j] = 1;
    }
  }
  for (int i = 2; i <= n; i++) {
    for (int j = 0; j <= len; j++) {
      fb[j][i] = fb[fb[j][i - 2]][i - 1];
      fbc[j][i] = min(INF, fbc[j][i - 2] + fbc[fb[j][i - 2]][i - 1]);
    }
  }
  v.pop_back();
  return fbc[0][n];
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k >> m;
  for (int i = 0; i < m; i++) {
    v.push_back(0);
    for (int j = 0; j < 2; j++) {
      long long c = getCount();
      if (c >= k) break;
      k -= c;
      v.back()++;
    }
    if (fb[0][n] == v.size()) {
      if (k == 1) break;
      k--;
    }
  }
  for (int i : v) cout << i;
  return 0;
}
