//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
//#include <unordered_map>
//#include <unordered_set>
#include <cassert>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
#include <complex>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#include <atcoder/convolution>
//#include <atcoder/lazysegtree>
//#include <atcoder/maxflow>
//#include <atcoder/mincostflow>
//#include <atcoder/segtree>
//#include <atcoder/string>
using namespace std;
//using namespace atcoder;
#define int long long
//#define L __int128
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define gnr(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define per(i,b) gnr(i,0,b)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) (int)(x.size())
#define pcnt(x) __builtin_popcountll(x)
#define all(x) x.begin(),x.end()

#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
 
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
 
template<class t> using vc=vector<t>;
 
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
 
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}
 
 //https://codeforces.com/blog/entry/62393
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}
 
	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
	//don't make x negative!
	size_t operator()(pair<int,int> x)const{
		return operator()(uint64_t(x.first)<<32|x.second);
	}
};
//unordered_set -> dtype, null_type
//unordered_map -> dtype(key), dtype(value)
using namespace __gnu_pbds;
template<class t,class u>
using hash_table=gp_hash_table<t,u,custom_hash>;

template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 998244353;
//const ll mod = 1000000007;
mt19937_64 mt(0);//chrono::steady_clock::now().time_since_epoch().count());

struct mint{
	ll v;
	mint(ll vv=0){s(vv%mod+mod);}
	mint& s(ll vv){
		v=vv<mod?vv:vv-mod;
		return *this;
	}
	mint operator-()const{return mint()-*this;}
	mint &operator+=(const mint&rhs){return s(v+rhs.v);}
	mint &operator-=(const mint&rhs){return s(v+mod-rhs.v);}
	mint &operator*=(const mint&rhs){v=ll(v)*rhs.v%mod;return *this;}
	mint &operator/=(const mint&rhs){return *this*=rhs.inv();}
	mint operator+(const mint&rhs)const{return mint(*this)+=rhs;}
	mint operator-(const mint&rhs)const{return mint(*this)-=rhs;}
	mint operator*(const mint&rhs)const{return mint(*this)*=rhs;}
	mint operator/(const mint&rhs)const{return mint(*this)/=rhs;}
	mint pow(ll n)const{
		if(n<0)return inv().pow(-n);
		mint res(1),x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	mint inv()const{return pow(mod-2);}
	friend mint operator+(ll x,const mint&y){
		return mint(x)+y;
	}
	friend mint operator-(ll x,const mint&y){
		return mint(x)-y;
	}
	friend mint operator*(ll x,const mint&y){
		return mint(x)*y;
	}
	friend mint operator/(ll x,const mint&y){
		return mint(x)/y;
	}
	friend ostream& operator<<(ostream&os,const mint&m){
		return os<<m.v;
	}
	friend istream& operator>>(istream&is,mint&m){
		ll x;is>>x;
		m=mint(x);
		return is;
	}
	bool operator<(const mint&r)const{return v<r.v;}
	bool operator==(const mint&r)const{return v==r.v;}
	bool operator!=(const mint&r)const{return v!=r.v;}
	explicit operator bool()const{
		return v;
	}
};
ll modpow(ll x,ll n,ll _md=mod){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%_md;
		x=x*x%_md;
		n>>=1;
	}
	return res;
}
#define _sz 1
mint F[_sz],R[_sz];
void make(){
	F[0] = 1;
	for(int i=1;i<_sz;i++) F[i] = F[i-1] * i;
	R[_sz-1] = F[_sz-1].pow(mod-2);
	for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1);
}
mint C(int a,int b){
	if(b < 0 || a < b) return mint();
	return F[a]*R[b]*R[a-b];
}
using ld=long double;
using vi=vc<int>;
using ull=unsigned long long;
/*int dst(P p, P q){
	return (p.a-q.a)*(p.a-q.a)+(p.b-q.b)*(p.b-q.b);
}*/
/*template<class t>
void add_inplace(t &a, t b){
	if(a.size() < b.size()) swap(a, b);
	for(int i=0;i<si(b);i++){
		a[i] += b[i];
		if(a[i] < 0) a[i] += mod;
		if(a[i] >= mod) a[i] -= mod;
	}
	return ;
}*/
template<class t>
void ov(const vc<t>&a){
	if(a.empty()) return;
	rep(i, si(a)) cout << a[i] << (i+1==si(a)?'\n':' ');
}
//o(ans?"Yes":"No");
int n,k,dd[105];
int f[1<<10], c[1<<10];
int look[1<<10], idx;
vi look2[10];
vc<string>cand;
int use[10];
int d, b;
void dfs(int dep, int las, bool z){
//	cout<<dep<<" "<<las<<" "<<z<<endl;
	if(si(cand) == k) return;
	if(dep == d){
		rep(i, idx) if(c[look[i]] < 0) goto nn;
		assert(false);
		nn:;
		//out<<dep<<" "<<las<<endl;
	//	rep(i,10)cout<<use[i]<<" ";cout<<endl;
		string str = "";
		str.pb('0'+b);
		rep(i,10){
			rep(j,use[i]-(i==b?1:0)) str.pb('0'+i);
		}
		cand.eb(str);
		return;
	}

	rep(nxt,10){
		if(!z and nxt == 0) continue;
		if(nxt and las >= nxt) continue;
		for(int go=d-dep;go>=1;go--){	bool ok = (d>n);
				for(auto b:look2[nxt]) {c[b] -= go; if(c[b]<0)ok=1;}
				use[nxt] += go;
			
				rng(i,max(las,nxt)+1,10){
					for(auto m:look2[i]){
						if(c[m] < d-(dep+go)){
							ok = 1;
							goto nm;
						}
					}
				}nm:;
				//if(ok)cout<<go<<endl;
				//cout<<ok<<" "<<dep<<" "<<go<<" "<<las<<" "<<nxt<<endl;
				if(ok) dfs(dep+go, max(las,nxt), false);
				
				use[nxt] -= go;
				for(auto b:look2[nxt]) c[b] += go;
				if(si(cand) == k) return;
			}
		/*{
			for(int go=d-dep;go>=1;go--){
				for(auto b:look2[nxt]) c[b] -= go;
				use[nxt] += go;
				bool ok = (d>n);
				rng(i,max(las,nxt)+1,10){
					for(auto m:look2[i]){
						if(c[m] < d-(dep+go)){
							ok = 1;
							goto nm;
						}
					}
				}nm:;
				//if(ok)cout<<go<<endl;
				//cout<<ok<<" "<<dep<<" "<<go<<" "<<las<<" "<<nxt<<endl;
				if(ok) dfs(dep+go, max(las,nxt), false);
				if(si(cand) == k) return;
				use[nxt] -= go;
				for(auto b:look2[nxt]) c[b] += go;
			}
		}*/
	}
}
void solve(){
	cin>>n>>k;
	rep(i,n){
		rep(j,6){
			int a;cin>>a;
			dd[i] |= (1<<a);
		}
		rep(mask,(1<<10)){
			if(dd[i]&mask) f[mask] ++;
		}
	}
	int mn = INF;
	rep(i,10) chmin(mn, f[(1<<i)]);
	rep(i,(1<<10)) if(i){
		look[idx++] = i;
		rep(j,10) if(((i>>j)&1)) look2[j].pb(i);
	}
	vc<string> ans;
	for(d=mn+1;d<=mn+6 and si(ans)<k;d++){
		cand.clear();
		
		repn(i,9){rep(i,(1<<10)) c[i]=f[i];
			bool ok = 0;
			rep(j,idx){
				if(((look[j]>>i)&1)){
					c[look[j]] --;
				}
				if(c[look[j]] < d-1){
					if(look[j]&1) ok = 1;
					rng(k,i,10) if(((look[j]>>k)&1)) ok = 1;
				}
			}
			if(ok){
				memset(use, 0, sizeof(use));
				use[i] = 1; b = i;
				dfs(1,i-1,true);
			}
			rep(j,idx){
				if(((look[j]>>i)&1)){
					c[look[j]] ++;
				}
			}
		}
		//o(cand);
		priority_queue<string,vc<string>,greater<string>>que;
		for(auto x:cand) que.push(x);
		while(!que.empty()){
			auto s = que.top(); que.pop();
			ans.pb(s);
			if(si(ans) == k) break;
			for(int i=d-2;i>=0;i--){
				if(s[i] < s[i+1]){
					char c='9';
					rng(j,i+1,d){
						if(s[i] < s[j]) chmin(c, s[j]);
					}
					int cnt[10] = {};
					rng(j,i,d){
						cnt[s[j]-'0'] ++;
					}
					cnt[c-'0']--;
					s = s.substr(0,i);
					s.pb(c);
					rep(i,10) rep(j,cnt[i]) s.pb('0'+i);
					que.push(s);
					break;
				}
			}
		}
	}
	rep(i,si(ans)-1) if(ans[i] < ans[i+1] or si(ans[i]) < si(ans[i+1])); else{cout<<ans[i]<<" "<<ans[i+1]<<endl;}
	rep(i,si(ans)) assert(ans[i][0] >= '1');
	assert(si(ans) == k);
	o(ans);
}
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int t; t = 1; //cin >> t;
	while(t--) solve();
}