#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int inf = 0x7ffffff;
int ch[maxn], n, k, s;
bool x = 1, y = 0;
int main() {
  cin >> n >> k >> s;
  for (int i = 0; i <= k; i++) {
    if (x)
      ch[i + 1] = s;
    else
      ch[i + 1] = 0;
    swap(x, y);
  }
  for (int i = k + 2; i <= n; i++) {
    ch[i] = inf;
  }
  for (int i = 1; i <= n; i++) {
    cout << ch[i];
  }
  return 0;
}
