#include<bits/stdc++.h>
using namespace std;
int n,b,d;
int a[70],to=1;
int dfs(int x,int y)
{
    int s=x^y,cnt=0;
    while(s)
    {
        cnt+=(s&1);	
        s>>=1;
    }
    return cnt;
}
int main()
{
    freopen("hamming.in","r",stdin);
    freopen("hamming.out","w",stdout);
    cin>>n>>b>>d;
    int Inf=(1<<b);
    int i;
    for(i=a[to]+1;i<=Inf;++i)
    {
        if(dfs(a[to],i)>=d)
        {
            bool flg=1;
            for(int j=1;j<to;++j)
                if(dfs(a[j],i)<d) {flg=0;break;}
            if(flg) a[++to]=i;
            if(to>=n) break;
        }
    }
    for(int i=1;i<=n;++i)
    {
        cout<<a[i];
        if(i%10) cout<<' ';
        else cout<<endl;
    }
    return 0;
}