#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

void place(array<int,12>& cts, set<string>& dest, string& built, int& lim){
	if(lim == 0) return;
	int tot = 0;
	rep(d,0,12)tot+=cts[d];
	rep(d,0,10){
		if(cts[d]+cts[10]==0) continue;
		if(d==0 && sz(built)==0) continue;
		int mode = 0;
		if(cts[d]>0){
			if(cts[11]>0) mode=2;
			else mode = 1;
		}
		if(mode==0) cts[10]--;
		else if(mode==2) cts[11]--;
		else cts[d]--;
		built.pb('0'+d);
		place(cts,dest,built, lim);
		built.pop_back();
		if(mode==0) cts[10]++;
		else if(mode==2) cts[11]++;
		else cts[d]++;
		if(lim==0) break;
	}
	if(tot==0){
		// cout<<"why <"<<built<<">"<<endl;
		dest.insert(built);
		lim--;
	}
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int n,k;cin>>n>>k;
	vi cubes(n,0);rep(i,0,n)rep(j,0,6){
		int d;cin>>d;
		cubes[i]|=1<<d;
	}
	vi zs(1<<10,0);
	rep(fam,2,1<<10){
		rep(i,0,n) if(cubes[i]&fam) zs[fam]++;
	}
	vector<vector<array<int,12>>> steps(n+10);
	rep(fam,2,1<<10) {
		int req = max(__builtin_popcount(fam),zs[fam]+1);
		array<int,12> cts={0};
		int fir = -1;
		rep(i,0,10) if(fam&(1<<i)){
			if(fir==-1) fir = i;
			cts[i]++;
		}
		cts[11] += req - __builtin_popcount(fam);
		rep(r,req,n+10){
			steps[r].pb(cts);
			cts[10]++;
		}


	}

	rep(i,1,n+10){
		if(k==0) break;
		set<string> o;
		for(auto& cts : steps[i]){
			string s="";
			int lim = k;
			// cout<<"CALLL"<<endl;
			place(cts, o, s, lim);
			while(sz(o)>k) o.erase(prev(o.end()));
		}
		k-=sz(o);
		for(string s : o)cout<<s<<' ';
	}
	cout<<'\n';
}