/*
TASK:number
LANG:C++
*/
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <cstdio>
#define pb push_back
#define FOR(i,n) for(i=0;i<n;i++)
using namespace std;

int ans[1001];
int comb[1001][1000];
int gredi[1000];

int main()
{
    int n,k,d,m,i,j;
    cin >> n >> k >> d;
    m=d+1;
    int br=0;
    ans[0]=1;
    for (i=0;i<k;i++)
    {
        m*=m;
        }
    if (m>n) br=1;
    if (br==0)
    {
              cout << "0\n";
              return 0;
              }
    for(i=0;;i++)
    {
          FOR(j,k)
          {comb[i][j]=gredi[j];}
          i++;
          while (next_permutation(gredi,gredi+k))
          {      FOR(j,k)
          {comb[i][j]=gredi[j];} i++;}
          br=0;
          j=0;
          while (gredi[j]==d){ if (gredi[j]!=d){ br=1; break;} j++;}
          if (br==0) break;
          j=k-1;
          while (gredi[j]==d){ gredi[j]=0; j--;}
          gredi[j]++;
          }
    m=i;
    FOR(i,m)
    {
            cout << comb[i];
            }
    
            
return 0;
}
