#include <bits/stdc++.h>
#define all(a) begin(a), end(a)
#define int long long
using namespace std;

vector<string> ans;

const int N = 111;
int d[N][6];
int n, k; 

string s;
int cnt[10];

typedef long long ll;
#define vi vector<int>
#define sz(a) (a).size()
struct Dinic {
	struct Edge{
		int to, rev;
		ll c, oc;
		ll flow() { return max(oc - c, 0LL); }
	};
	vi lvl, ptr, q;
	vector<vector<Edge>> adj;
	Dinic(int n) : lvl(n), ptr(n), q(n), adj(n) {};
	void addEdge(int a, int b, ll c, ll rcap = 0) {
		adj[a].push_back({b, (int)adj[b].size(), c, c});
		adj[b].push_back({a, (int)adj[a].size() - 1, rcap, rcap});
	}

	ll dfs(int v, int t, ll f) {
		if (v == t || !f) return f;
		for (int& i = ptr[v]; i < adj[v].size(); i++) {
			Edge& e = adj[v][i];
			if (lvl[e.to] == lvl[v] + 1)
				if (ll p = dfs(e.to, t, min(f, e.c))) {
					e.c -= p, adj[e.to][e.rev].c += p;
					return p;
				}
		}
		return 0;
	}
	ll tot_flow = 0;
	ll calc(int s, int t) {
		ll flow = 0; q[0] = s;
		for (int L = 30; L < 31; L++) do {
			lvl = ptr = vi(sz(q));
			int qi = 0, qe = lvl[s] = 1;
			while (qi < qe && !lvl[t]) {
				int v = q[qi++];
				for (Edge e : adj[v])
					if (!lvl[e.to] && e.c >> (30 - L))
						q[qe++] = e.to, lvl[e.to] = lvl[v] + 1;
			}
			while (ll p = dfs(s, t, LLONG_MAX)) flow += p;
		} while (lvl[t]);
		tot_flow += flow;
		return tot_flow;
	}
};

void rec(int l, int rm, Dinic& dinic){
	if (k == 0) return;
	if (rm == 0) {
		if (dinic.calc(n + 10, n + 11) != l) {
			ans.push_back(s); --k;
		}
		return;
	}
	bool might_fail = false;
	for (int dig = 0; dig < 10; dig++) {
		dinic.addEdge(n + dig, n + 11, rm);
		if (dinic.calc(n + 10, n + 11) != l) {
			might_fail = true;
		}
		dinic.addEdge(n + 10, n + dig, rm);
		dinic.tot_flow -= rm;
	}
	if (!might_fail) return;
	for (char c = (rm == l) ? '1' : '0'; c <= '9'; c++) {
		cnt[c - '0']++;
		dinic.addEdge(n + (c - '0'), n + 11, 1);
		s.push_back(c); rec(l, rm - 1, dinic);
		dinic.addEdge(n + 10, n + (c - '0'), 1);
		dinic.tot_flow -= 1;
		cnt[c - '0']--; s.pop_back();
		if (k == 0) return;
	}
}

void solve(){
	cin >> n >> k;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 6; j++) cin >> d[i][j];
	}
	Dinic dinic(n + 12);
	for (int i = 0; i < n; i++) {
		dinic.addEdge(n + 10, i, 1);
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 6; j++) {
			dinic.addEdge(i, n + d[i][j], 1);
		}
	}
	for (int l = 1; k; l++) {
		rec(l, l, dinic);
	}
	for (auto x : ans) {
		cout << x << ' ';
	}
	cout << '\n';
}

int32_t main(){
#ifndef LOCAL
	cin.tie(0)->sync_with_stdio(false);
#endif
	int t = 1;
	// cin >> t;
	while (t--) {
		solve();
	}
}