#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5, M = 105, T = 2e7 + 5, m = 10;

struct BigNumber{
	int n, pos;
	char s[M];
	inline void Write()
	{
		reverse(s, s + n);
		for(int i = 0; i < n; i ++ ) s[i] ^= 48;
		printf("%s ", s);
		reverse(s, s + n);
		for(int i = 0; i < n; i ++ ) s[i] ^= 48;
	}
	inline void Make(BigNumber &t, int i, int x)
	{
		for(int j = 0; j < i; j ++ ) s[j] = t.s[j];
		s[i] = x;
		for(int j = i; j < t.n; j ++ ) s[j + 1] = t.s[j];
		n = t.n + 1, pos = i + 1;
	}
	inline bool operator <= (const BigNumber &w) const
	{
		if(n != w.n) return n < w.n;
		for(int i = n - 1; i >= 0; i -- )
			if(s[i] != w.s[i])
				return s[i] < w.s[i];
		return 1;
	}
	inline bool operator != (const BigNumber &w) const
	{
		if(n != w.n) return 1;
		for(int i = 0; i < n; i ++ )
			if(s[i] != w.s[i])
				return 1;
		return 0;
	}
};

bool ST;
int n, k;
bitset<M> vis[m];
int f[N], st[N];
BigNumber s[N], r[N], cur;
int p0, p1, c1;
struct Node{
	unsigned t : 18;
	unsigned i : 8;
	unsigned x : 4;
}x[T], y[T];
int cnt[N];
bool ED;

inline int GetBit(Node &x, int i)
{
	return i < x.i ? s[x.t].s[i] : (i == x.i ? x.x : s[x.t].s[i - 1]);
}
inline int GetBlock(Node &x, int i)
{
	return ((((GetBit(x, i + 4) * 10 + GetBit(x, i + 3)) * 10) + GetBit(x, i + 2)) * 10 + GetBit(x, i + 1)) * 10 + GetBit(x, i);
}
inline void Sort(int n, int m)
{
	if(!m) return ;
	int c = 0;
	for(int i = 0; i < m; i ++ )
		for(int j = s[i].pos; j < n; j ++ )
			for(int k = (j == n - 1); k < 10; k ++ )
				if(!j || s[i].s[j - 1] != k)
					c ++ , x[c].t = i, x[c].i = j, x[c].x = k;
	// puts("");
	// for(int i = 0; i < c; i ++ )
	// {
	// 	cur.Make(s[x[i].t], x[i].i, x[i].x);
	// 	cur.Write();
	// }
	// exit(0);
	Node *p = x, *q = y;
	for(int i = 0; i < n; i += 5)
	{
		for(int j = 0; j < c; j ++ ) cnt[GetBlock(p[j], i)] ++ ;
		for(int j = 1; j < N; j ++ ) cnt[j] += cnt[j - 1];
		for(int j = c - 1; j >= 0; j -- ) q[ -- cnt[GetBlock(p[j], i)]] = p[j];
		for(int j = 0; j < N; j ++ ) cnt[j] = 0;
		swap(p, q);
	}
	r[0].Make(s[p[0].t], p[0].i, p[0].x), c1 = 1;
	for(int i = 1; i < c; i ++ )
	{
		cur.Make(s[p[i].t], p[i].i, p[i].x);
		if(cur != r[c1 - 1]) r[c1 ++ ] = cur;
		if(c1 >= k) break;
	}
}
inline void DFS(int i, int ty, int S)
{
	if(!st[S] || p0 == k) return ;
	if(i < 0)
	{
		while(p1 < c1 && p0 < k && r[p1] <= cur) s[p0 ++ ] = r[p1 ++ ];
		if(p0 < k && s[p0 - 1] != cur) s[p0 ++ ] = cur;
		return ;
	}
	for(int j = ty; j < m; j ++ )
	{
		cur.s[i] = j;
		DFS(i - 1, 0, S | (1 << j));
	}
}

int main()
{
	scanf("%d%d", &n, &k);
	for(int i = 0; i < n; i ++ )
		for(int j = 0; j < 6; j ++ )
		{
			int x;
			scanf("%d", &x);
			vis[x].set(i);
		}
	for(int i = 0; i < 1 << m; i ++ )
	{
		bitset<M> mask;
		for(int j = 0; j < m; j ++ )
			if(i >> j & 1)
				mask |= vis[j];
		f[i] = mask.count() + 1;
	}

	for(int i = 1; k; i ++ )
	{
		Sort(i, p0);
		for(int j = (1 << m) - 1; j >= 0; j -- )
		{
			st[j] |= f[j] <= i;
			for(int k = 0; k < m; k ++ )
				st[j] |= st[j | 1 << k];
		}
		p0 = p1 = 0;
		cur.n = i, cur.pos = 0;
		DFS(i - 1, 1, 0);
		for(int i = 0; i < p0; i ++ ) s[i].Write();
		k -= p0;
	}
	puts("");
	
	return 0;
}