#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005;
const ll INF=1LL<<60;

string S;
vector<string> use;

void DFS(int u,int rem,int mask,int need){
    if(rem<need) return;
    if(u==10) return;
    if((1<<u)>mask&&need) return;
    if(rem<0) return;
    if(u==0&&rem==0) return;
    if(rem==0){
        //cout<<mask<<" "<<S<<endl;
        use.push_back(S);
        return;
    }
    
    //cout<<u<<" "<<rem<<" "<<mask<< ""<<need<<endl;
    
    DFS(u+1,rem,mask,need);
    
    S+=char('0'+u);
    DFS(u,rem-1,mask,need-((mask&(1<<u))>0));
    S.pop_back();
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N,K;cin>>N>>K;
    vector<int> SS(N);
    for(int i=0;i<N;i++){
        for(int j=0;j<6;j++){
            int x;cin>>x;
            SS[i]|=(1<<x);
        }
    }
    
    vector<int> lim(1<<10);
    for(int bit=2;bit<(1<<10);bit++){
        for(int i=0;i<N;i++){
            bool f=false;
            for(int j=0;j<10;j++){
                if((bit&(1<<j))&&(SS[i]&(1<<j))) f=true;
            }
            if(f) lim[bit]++;
        }
    }
    
    for(int n=1;;n++){
        use.clear();
        for(int bit=2;bit<(1<<10);bit++){
            if(n>lim[bit]){
                DFS(0,n,bit,lim[bit]+1);
            }
        }
        sort(all(use));
        use.erase(unique(all(use)),use.end());
        
        priority_queue<string,vector<string>,greater<string>> PQ;
        for(string X:use){
            string S=X;
            auto it=lower_bound(all(S),'1');
            swap(S[0],S[it-S.begin()]);
            PQ.push(S);
            //cout<<X<<" "<<S<<endl;
        }
        
        while(!PQ.empty()){
            auto X=PQ.top();PQ.pop();
            cout<<X<<" ";K--;
            if(K==0){
                cout<<endl;
                return 0;
            }
            if(next_permutation(all(X))){
                PQ.push(X);
            }
        }
    }
}