#include <iostream>

#include <fstream>

#include <string>

#include <string.h>

#include <vector>

#include <algorithm>

#include <stack>

#include <map>

using namespace std;

ofstream fout("hamming.out");

ifstream fin ("hamming.in");

const int INF = 999999999;

typedef pair<int, int> pii;

typedef vector<int> vi;

#define all(c) (c).begin(), (c).end()

#define tr(container, it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)

int N,B,D;

const int MAXN = 270;

int list[MAXN][MAXN];

int szs[MAXN];

int ans[MAXN], ptr = 0;

bool should_break;

void dfs(int num, int cur){

}

void work(){

}

int main(){

}