#include <bits/stdc++.h>

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int n, k;
    std::cin >> n >> k;
    std::vector<int> cnt(1024);
    for (int i = 0; i < n; i += 1) {
        int mask = 0;
        for (int j = 0; j < 6; j += 1) {
            int x;
            std::cin >> x;
            mask |= 1 << x;
        }
        for (int m = 0; m < 1024; m += 1) {
            if (m & mask) {
                cnt[m] += 1;
            }
        }
    }

    
    std::vector<int> b(n + 1);
    std::vector<int> c(n + 1);
    for (int len = 1; k; len += 1) {
        std::vector<std::pair<int, int> > bad;
        for (int mask = 0; mask < 1024; mask += 1) {
            if (cnt[mask] < len) bad.emplace_back(mask, cnt[mask]);
        }
        auto find_all = [&](auto self, int u) {
            if (k == 0) return;
            if (u == len) {
                k -= 1;
                for (int i = 0; i < len; i += 1) {
                    std::cout << b[i];
                }
                std::cout << " ";
                return;
            }
            for (int i = (u == 0); i < 10; i += 1) {
                b[u] = i;
                self(self, u + 1);
            }
        };

        auto dfs = [&](auto self, int u) {
            if (k == 0) return;
            if (u == len) {
                k -= 1;
                for (int i = 0; i < len; i += 1) {
                    std::cout << c[i];
                }
                std::cout << " ";
                return;
            }
            for (int i = (u == 0); i < 10; i += 1) {
                c[u] = i;
                b[u] = i;
                int mn = 1e9;
                for (auto &[mask, cnt] : bad) {
                    if (mask >> i & 1) {
                        cnt -= 1;
                    }
                    mn = std::min(mn, cnt);
                }


                if (mn < 0) {
                    find_all(find_all, u + 1);
                }

                else if (mn < len - 1 - u) {
                    self(self, u + 1);
                }
                // std::cerr << len << " " << u << " " << i << " " << mn << "\n";

                for (auto &[mask, cnt] : bad) {
                    if (mask >> i & 1) {
                        cnt += 1;
                    }
                }
            }
        };
        dfs(dfs, 0);
    }
    std::cout << "\n";
    return 0;
}