Let's denote (yet again) the sequence of Fibonacci strings:

F(0) =  0, F(1) =  1, F(i) = F(i - 2) + F(i - 1), where the plus sign denotes the concatenation of two strings.

Let's denote the lexicographically sorted sequence of suffixes of string F(i) as A(F(i)). For example, F(4) is 01101, and A(F(4)) is the following sequence: 01, 01101, 1, 101, 1101. Elements in this sequence are numbered from 1.

Your task is to print m first characters of k-th element of A(F(n)). If there are less than m characters in this suffix, then output the whole suffix.

Input

The only line of the input contains three numbers n, k and m (1 ≤ n, m ≤ 200, 1 ≤ k ≤ 10^{18}) denoting the index of the Fibonacci string you have to consider, the index of the element of A(F(n)) and the number of characters you have to output, respectively.

It is guaranteed that k does not exceed the length of F(n).

Output

Output m first characters of k-th element of A(F(n)), or the whole element if its length is less than m.

Examples

Input

4 5 3


Output

110


Input

4 3 3


Output

1
#include <bits/stdc++.h>
using namespace std;
inline long long mod(long long n, long long m) {
  long long ret = n % m;
  if (ret < 0) ret += m;
  return ret;
}
long long gcd(long long a, long long b) {
  return (b == 0LL ? a : gcd(b, a % b));
}
long long exp(long long a, long long b, long long m) {
  if (b == 0LL) return 1LL;
  if (b == 1LL) return mod(a, m);
  long long k = mod(exp(a, b / 2, m), m);
  if (b & 1LL) {
    return mod(a * mod(k * k, m), m);
  } else
    return mod(k * k, m);
}
long long n, m;
long long k;
const long long inf = (long long)1e18 + (long long)1e6;
vector<long long> PI(string s) {
  long long n = (long long)s.length();
  vector<long long> pi(n);
  for (long long i = 1; i < n; i++) {
    long long j = pi[i - 1];
    while (j > 0 && s[i] != s[j]) j = pi[j - 1];
    if (s[i] == s[j]) j++;
    pi[i] = j;
  }
  return pi;
}
long long aut[250][2];
void build_aut(string s) {
  s += '#';
  vector<long long> pi = PI(s);
  for (long long i = 0; i < ((long long)s.size()); i++) {
    for (long long c = 0; c < (2); ++c) {
      if (i > 0 and '0' + c != s[i])
        aut[i][c] = aut[pi[i - 1]][c];
      else
        aut[i][c] = i + ('0' + c == s[i]);
    }
  }
}
long long cnt[250][250];
long long pos[250][250];
long long num(string s) {
  build_aut(s);
  for (long long j = 0; j < (((long long)s.size()) + 1); ++j)
    for (long long i = 0; i < (n + 1); ++i) pos[i][j] = cnt[i][j] = 0;
  for (long long j = 0; j < (((long long)s.size()) + 1); ++j) {
    for (long long c = 0; c < (2); ++c) {
      pos[c][j] = aut[j][c];
      cnt[c][j] = (aut[j][c] == ((long long)s.size()));
    }
  }
  for (long long i = 2; i <= n; i++) {
    for (long long j = 0; j < (((long long)s.size()) + 1); ++j) {
      long long mid = pos[i - 2][j];
      pos[i][j] = pos[i - 1][mid];
      cnt[i][j] = cnt[i - 2][j] + cnt[i - 1][mid];
      cnt[i][j] = min(cnt[i][j], inf);
    }
  }
  return cnt[n][0];
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> k >> m;
  string cur = "";
  for (long long i = 0; i < m; i++) {
    long long happen = 0;
    if (cur != "") {
      num(cur);
      if (pos[n][0] == i) happen = 1;
    }
    if (k == 1 and happen) break;
    k -= happen;
    long long op1 = num(cur + '0');
    if (k > op1)
      k -= op1, cur += '1';
    else
      cur += '0';
  }
  cout << cur << "\n";
}
