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

struct Graph
{
    int num, n, tot, match;
    int head[150], nxt[2000000], to[2000000], cap[2000000], ban[2000000];
    int g[150], dis[150];
    vector<int> edge[10];
    void add(int x, int y, int z)
    {
        to[tot] = y, nxt[tot] = head[x], cap[tot] = z, head[x] = tot++;
        to[tot] = x, nxt[tot] = head[y], cap[tot] = 0, head[y] = tot++;
    }
    void init(int _n, vector<vector<int>> &a)
    {
        num = _n;
        n = num + 11;
        tot = match = 0;
        memset(head, -1, sizeof(head));
        for (int i = 1; i <= _n; i++)
            add(0, i, 1);
        for (int i = 0; i < _n; i++)
            for (int j : a[i])
                add(i + 1, num + j + 1, 1);
    }
    bool bfs(int s, int t)
    {
        for (int i = 0; i <= n; i++)
            dis[i] = -1;
        queue<int> que;
        que.push(s);
        dis[s] = 0;
        while (!que.empty())
        {
            int cur = que.front();
            que.pop();
            g[cur] = head[cur];
            for (int p = head[cur]; ~p; p = nxt[p])
            {
                if (!ban[p] && dis[to[p]] == -1 && cap[p])
                {
                    dis[to[p]] = dis[cur] + 1;
                    que.push(to[p]);
                }
            }
        }
        return dis[t] != -1;
    }
    int dfs(int cur, int t, int flow)
    {
        if (cur == t)
            return flow;
        int used = 0;
        for (int &p = g[cur]; ~p; p = nxt[p])
        {
            if (!ban[p] && dis[to[p]] == dis[cur] + 1 && cap[p])
            {
                int k = dfs(to[p], t, min(flow - used, cap[p]));
                used += k;
                cap[p] -= k, cap[p ^ 1] += k;
                if (used == flow)
                    return used;
            }
        }
        return used;
    }
    int dinic(int s, int t)
    {
        int res = 0;
        while (bfs(s, t))
            res += dfs(s, t, 1e9);
        return res;
    }
    void add(int x)
    {
        edge[x].push_back(tot);
        add(num + x + 1, n, 1);
        if (bfs(0, n))
            match += dfs(0, n, 1);
    }
    void del(int x)
    {
        int cur = edge[x].back();
        edge[x].pop_back();
        ban[cur] = 1;
        if (!cap[cur])
        {
            bfs(num + x + 1, 0);
            dfs(num + x + 1, 0, 1);
            match--;
        }
    }
    void print()
    {
        for (int i = 0; i <= 9; i++)
            cout << i << ' ' << edge[i].size() << '\n';
    }
} G;

string now;
int k, n;
bool check(int ad, int all)
{
    bool flag = true;
    for (int i = 0; i < 10; i++)
    {
        for (int j = 0; j < ad; j++)
            G.add(i);
        if (G.match != all)
            flag = false;
        for (int j = 0; j < ad; j++)
            G.del(i);
        if (!flag)
            return true;
    }
    return false;
}
void dfs(int i, int p)
{
    // cout << "i=" << i << " p=" << p << " now=" << now << "\n";
    // G.print();
    if (i == -1)
    {
        if (now.empty())
            return;
        cout << now << " ";
        k--;
        if (k == 0)
            exit(0);
        return;
    }
    for (int x = p; x <= 9; x++)
    {
        now.push_back(char(x + '0'));
        G.add(x);
        if (check(i, (int)now.size() + i))
        {
            dfs(i - 1, 0);
        }
        G.del(x);
        now.pop_back();
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> k;
    vector<vector<int>> a;
    for (int i = 1; i <= n; i++)
    {
        int t = 6;
        vector<int> p(t);
        for (int j = 0; j < t; j++)
            cin >> p[j];
        a.push_back(p);
    }
    G.init(n, a);
    // cout<<G.match<<"\n" ;
    for (int l = 1; l <= 100; l++)
    {
        dfs(l - 1, 1);
    }
    assert(false);
}