#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;
#define LL long long
#define MAXM 3010
#define MAXN 3010
const int N =1e5+10;
const int INF =0x3f3f3f3f;
int n,b,d;
int a[70],lens,num;
int check(int x,int y)
{
    int k=x^y,ans=0;
    while(k>0)
    {
        ans++;
        k-=k&(-k);
    }
    return ans;
}
int main ()
{
    bool flag=1;
    scanf("%d%d%d",&n,&b,&d);
    while(lens<n)
    {
        flag=1;
        for(int i=1;i<=lens;++i)
            if(check(a[i],num)<d) flag=0;
        if(flag) a[lens++]=num;
        num++; 
    }
    for(int i=1;i<=n;++i)
    {
        printf("%d ",a[i-1]);
        if((i%10)==0) cout<<endl;
    }
   return 0;
}