#include <iostream>
#include <vector>
#include <limits>
#include <string>
#include <queue>
using namespace std;

const int inf = numeric_limits<int>::max()/2;



void fulk(int n, int k, vector<vector<int>> &cap, vector<vector<int>> adj){
    int st=0;
    int nr = n+k+2;
    int dest=n+k+1;
    bool go=1;

    while(go){
        go=false;
        //bfs from st to dest
        vector<int> parent(nr,-1);
        vector<int> vis(nr,0);
        queue<int> q;
        q.push(st);
        vis[st]=1;
        
        while(!q.empty()){
            int v = q.front(); q.pop();
            for(auto ng:adj[v]){
                if(!vis[ng] && cap[v][ng]){
                    q.push(ng);
                    parent[ng]=v;
                    if(ng==dest) goto cont;
                }
            }
        }
    
        continue;
        cont:
            go=true;
            int c=dest;
            while(c!=0){
                cap[c][parent[c]]++;
                cap[parent[c]][c]--;
                c=parent[c];
            }
    }
}




int main()
{
    int n, k;
    cin>>n>>k;


    vector< string > names(n+1);
    vector< vector<int> > cap((n+k+2), vector<int>(n+k+2,0));
    vector< vector<int> > adj(n+k+2);

    for(int i=1;i<=n;++i) adj[i].reserve(k);

    for(int i=1;i<=n;++i){
        adj[0].push_back(i);
        cap[0][i]=1;
    }

    for(int i=n+1; i<n+k+1; ++i){
        adj[i].push_back(n+k+1);
        cap[i][n+k+1]=1;
    }


    for(int c=1;c<n+1;++c){
        cin>>names[c];
        int pp = inf, p = inf;
        for(int d=1;d<k+1;++d){
            int x; 
            cin>>x;
            if(pp<p && p<x){
                adj[c].push_back(n+d);
                adj[n+d].push_back(c);
                cap[c][n+d]=1; 
            }
            pp=p;
            p=x;
        }
    }


    vector<int> res(k+1,-1);
    fulk(n,k,cap,adj);
   
    for(int c=1;c<=n;++c){
        for(auto i : adj[c]){
            if(cap[c][i]==0) res[i-n]=c;
        }
    }

    for(int i=1;i<=k;++i){
        if(res[i]==-1) cout<<"none"<<'\n';
        else cout<<names[res[i]]<<'\n';
    }
}