/*

ID: wushuai2

PROG: hamming

LANG: C++

*/

//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler

#include <stdio.h>

#include <iostream>

#include <fstream>

#include <cstring>

#include <cmath>

#include <stack>

#include <string>

#include <map>

#include <set>

#include <list>

#include <queue>

#include <vector>

#include <algorithm>

#define Max(a,b) (((a) > (b)) ? (a) : (b))

#define Min(a,b) (((a) < (b)) ? (a) : (b))

#define Abs(x) (((x) > 0) ? (x) : (-(x)))

#define MOD 1000000007

#define pi acos(-1.0)

using namespace std;

typedef long long           ll      ;

typedef unsigned long long  ull     ;

typedef unsigned int        uint    ;

typedef unsigned char       uchar   ;

template<class T> inline void checkmin(T &a,T b){if(a>b) a=b;}

template<class T> inline void checkmax(T &a,T b){if(a<b) a=b;}

const double eps = 1e-      ;

const int M =          ;

const ll P = 10000000097ll   ;

const int INF = 0x3f3f3f3f   ;

const int MAX_N =          ;

const int MAXSIZE = ;

int n, b, d;

int ans[];

bool func(int b){

    int i, j, cnt;

    int t1[], t2[];

    memset(t2, , sizeof(t2));

    while(b){

        t2[++t2[]] = b % ;

        b = (b - b % ) / ;

    }

    for(int k = ; k <= ans[]; ++k){

        cnt = ;

        int a = ans[k];

        memset(t1, , sizeof(t1));

        while(a){

            t1[++t1[]] = a % ;

            a = (a - a % ) / ;

        }

        for(i = ; i <= Max(t1[], t2[]); ++i){

            if(t1[i] != t2[i])  ++cnt;

        }

        if(cnt < d)    return false;

    }

    return true;

}

int main() {

    ofstream fout ("hamming.out");

    ifstream fin ("hamming.in");

    int i, j, k, t, n, s, c, w, q;

    fin >> n >> b >> d;

    ++ans[];

    ans[] = ;

    int num = ;

    while(ans[] <= n){

        if(func(num)){

            ++ans[];

            ans[ans[]] = num;

        }

        ++num;

    }

    for(i = ; i < ans[]; ++i){

        fout << ans[i];

        if(i == ans[] - ){

            break;

        }

        if(i %  == ) fout << endl;

        else    fout << ' ';

    }

    fout << endl;

    fin.close();

    fout.close();

    return ;

}