#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, k, x;
int d[110][110];
string s[120], rs[120];
bool b[110];
struct my{
    int idx;
    vector < int > V;
} a[120];

bool cmp(my a, my b)
{
    return (a.V.size() < b.V.size() || (a.V.size() == b.V.size() && a.V < b.V));
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        cin >> s[i];
        for (int j = 1; j <= k; j++)
        {
            cin >> x, d[i][j] = x;
            if (j <= 2) continue;
            a[i].idx = i;
            if (d[i][j-2] < d[i][j-1] && d[i][j-1] < d[i][j]) a[i].V.push_back(j);
        }
    }
    sort(a+1, a+n+1, cmp);
    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j < a[i].V.size(); j++)
            if (!b[a[i].V[j]])
            {
                rs[a[i].V[j]] = s[a[i].idx];
                b[a[i].V[j]] = 1;
                break;
            }
    }
    for (int i = 1; i <= k; i++)
    {
        cout << (rs[i] == "" ? "none" : rs[i]) << "\n";

    }
}