#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;

typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef long long ll;

template <typename _T>
inline void read(_T &f) {
    f = 0; _T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}

template <typename T>
void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}

template <typename T>
void print(T x, char t) {
    print(x); putchar(t);
}

const int N = 105;

int sum[1 << 10], a[7];
int n, k;

int res[N], len, cnt;
void dfs(int u, int nlen, int free) {
    int can = 0, mx = 0;
    if (free) mx = free;
    else {
        for (int i = 1; i < (1 << 10); i++) {
            if (sum[i] < len - nlen) {
                can |= i;
                mx = max(mx, len - nlen - sum[i] - 1);
            }
        }
    }
    if (mx) can = 1023;
    if (!can) return;
    if (len == nlen) {
        --k;
        for (int i = 0; i < len; i++) putchar(res[i] + '0');
        putchar(' ');
        if (!k) {
            putchar('\n');
            exit(0);
        }
        return;
    }
    ++cnt;
    // if (cnt % 100000 == 0) fprintf(stderr, "cnt = %d, k = %d\n", cnt, k);
    for (int i = (nlen == 0); i <= 9; i++) {
        if (!((can >> i) & 1)) continue;
        for (int j = 1; j < (1 << 10); j++) {
            if ((j >> i) & 1) {
                --sum[j];
            }
        }
        res[nlen] = i;
        dfs(u + 1, nlen + 1, max(0, mx - 1));
        for (int j = 1; j < (1 << 10); j++) {
            if ((j >> i) & 1) {
                ++sum[j];
            }
        }
    }
}

mt19937 rng(0);

int main() {
    read(n); read(k);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 6; j++) {
            read(a[j]);
            /*
            a[j] = rng() % 10;
            while (1) {
                int ok = 1;
                for (int k = 1; k < j; k++) {
                    if (a[k] == a[j]) {
                        ok = 0;
                        break;
                    }
                }
                if (ok) break;
                a[j] = rng() % 10;
            }
            */
        }
        for (int j = 1; j < (1 << 10); j++) {
            int ok = 0;
            for (int k = 1; k <= 6; k++) {
                if ((j >> a[k]) & 1) {
                    ok = 1;
                }
            }
            if (ok) ++sum[j];
        }
    }
    for (len = 1; ; len++) dfs(1, 0, 0);
    return 0;
}