#include <bits/stdc++.h>

#define LL long long
#define ull unsigned long long
#define F(i, j, k) for (int i = j; i <= k; ++i)
#define DF(i, j, k) for (int i = j; i >= k; --i)

using namespace std;

template <typename T> inline void read(T &n) {
    T w = 1;
    n = 0;
    char ch = getchar();
    while (!isdigit(ch) && ch != EOF) {
        if (ch == '-') w = -1;
        ch = getchar();
    }
    while (isdigit(ch) && ch != EOF) {
        n = (n << 3) + (n << 1) + (ch & 15);
        ch = getchar();
    }
    n *= w;
}

template <typename T> inline void write(T x) {
    T l = 0;
    ull y = 0;
    if (!x) { putchar(48); return; }
    if (x < 0) { x = -x; putchar('-'); }
    while (x) { y = y * 10 + x % 10; x /= 10; ++l; }
    while (l) { putchar(y % 10 + 48); y /= 10; --l; }
}

template <typename T> inline void writes(T x) {
    write(x);
    putchar(' ');
}

template <typename T> inline void writeln(T x) {
    write(x);
    puts("");
}

template <typename T> inline void checkmax(T &a, T b) { a = a > b ? a : b; }

template <typename T> inline void checkmin(T &a, T b) { a = a < b ? a : b; }

const int N = 100, K = 100, debug = 1;

int a[110][10], dp[1100], c[1100];

int now = 0, n, k;

inline void dfs(int x, vector <pair<int, int>> v) {
    if (v.empty()) return;
    if (x > now) {
        --k;
        F(i, 1, now) write(c[i]);
        if (k == 0) putchar('\n');
        else putchar(' ');
        if (k == 0) exit(0);
        return;
    }
    F(i, (x == 1) ? 1 : 0, 9) {
        vector <pair<int, int> > t;
        for (auto y : v) {
            int A = y.first, B = y.second;
            if ((A >> i) & 1) --B;
            if (now - x > B) t.emplace_back(A, B);
        }
        c[x] = i;
        dfs(x + 1, t);
    }
}

int main() {
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    srand(time(0));
    if (debug) {
        n = N;
        k = K;
        F(i, 1, n)
            F(j, 1, 6) {
                int x; x = rand() % 10;
                a[i][x] = 1;
            }
    }
    else {
        read(n); read(k);
        F(i, 1, n)
            F(j, 1, 6) {
                int x; read(x);
                a[i][x] = 1;
            }
    }
    F(i, 0, (1 << 10) - 1) {
        F(k, 1, n) {
            int cur = 0;
            F(j, 0, 9)
                if ((i >> j) & 1)
                    cur |= a[k][j];
            dp[i] += cur;
        }
    }
    now = 0;
    while (k) {
        ++now;
        vector <pair<int, int> > v;
        F(i, 1, (1 << 10) - 1) if (now > dp[i]) v.emplace_back(i, dp[i]);
        dfs(1, v);
    }
    return 0;
}