#include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int procc=0;

struct genr {
    map<int,int> inclp;
    int k;
    int inclc=0;
    int recdep;
    deque<int> digs;
    genr(set<int>const&incld,int k):k(k){
        auto it = incld.end();it--;
        int p=*it;
        for(int d:incld)inclp[p]=d,p=d;
        it = incld.begin();
        int lo=*it;
        int v=lo?lo:*++it;
        digs.push_back(v);
        inclc=1;
        while(inclc<=k)inclc++,digs.push_back(lo);
    }
    int next()const{
        int v=0;
        for(int d:digs)v=v*10+d;
        return v;
    }
    void step(int restorincls=-1){
        if(restorincls==-1){
            // cout<<"STart:";
            // pp();
            procc++;
            recdep=1;
            restorincls=inclc==k+1;
        } else {
            recdep++;
        }
        // if(procc==2){
        //     cout<<"Proc:"<<next()<<endl;
        // }
        if(!sz(digs)){
            digs.push_back(1);
            if(inclp.count(1))inclc++;
            recdep--;
            return;
        }

        

        int ld=digs.back();
        int nld=(ld+1)%10;
        if(inclp.count(ld)){
            inclc--;
            if(restorincls){
                nld=inclp[ld];
            }
        }
        // if(procc==2)
        // cout<<"  ld,nld:"<<ld<<','<<nld<<'\n';
        if(nld>ld){
            digs.back()=nld;
            if(inclp.count(nld))inclc++;
            recdep--;
            return;
        }

        if(restorincls&&!inclp.count(ld))restorincls=0;
        digs.pop_back();
        step(restorincls);

        int spaceleft=recdep;
        int nummoreneeded=k+1-inclc;
        assert(nummoreneeded<=spaceleft);
        if(spaceleft==nummoreneeded)nld=inclp.begin()->first;
        else nld=0;
        digs.push_back(nld);
        if(inclp.count(nld))inclc++;

        recdep--;
    }
    void pp(){
        for(auto [a,b]:inclp)cout<<a<<"->"<<b<<"  ";
        cout<<next()<<'\n';
    }
};
struct genrcomp {
    bool operator()(genr const *a, genr const *b)const{return a->next()>b->next();}
};

int hasinter(set<int>const&a,set<int>const&b){
    const set<int> *sm=&a,*la=&b;
    if(sz(a)>sz(b))sm=&b,la=&a;
    for(int v:*sm)if(la->count(v))return 1;
    return 0;
}

int main() {
    int n,k,v;cin>>n>>k;
    vector<set<int>> cubes(n);
    rep(i,0,n)rep(j,0,6)cin>>v,cubes[i].insert(v);
    priority_queue<genr*,vector<genr*>,genrcomp> genrs;
    set<int> incl;
    int p=0,ko;
    rep(m,2,1<<10){
        rep(i,0,10)if((p^m)&(1<<i)){
            if(p&(1<<i))incl.erase(i);
            else incl.insert(i);
        }
        ko=0;
        for(auto&s:cubes)ko+=hasinter(s,incl);
        genrs.push(new genr(incl,ko));
        p=m;
    }
    string sep="";
    while(k--){

        // vector<genr*> store;
        // rep(i,0,10){
        //     genrs.top()->pp();
        //     store.push_back(genrs.top());
        //     genrs.pop();
        // }
        // for(genr*g:store)genrs.push(g);
        // cout<<"\n";

        int v=genrs.top()->next();
        cout<<sep<<v;
        // cout<<"\n\n";
        sep=" ";
        while(v==genrs.top()->next()){
            genr*t=genrs.top();
            genrs.pop();
            t->step();
            genrs.push(t);
        }
    }
    cout<<endl;
    // while(sz(genrs)){
    //     genrs.top()->pp();
    //     genrs.pop();
    // }
}