#include <bits/stdc++.h>
using namespace std;

int i, j, x, y, n, k, a[105], freq[105], sz[105], dp[105][105], rsx, rsy, id[105];
pair<int, int> drum[105][105];
bool v[105][105];
string name[105], ans[105];

void get_ans(int x, int y) {
  if(!x || !y) return;

  ans[y] = name[id[x]];
  get_ans(drum[x][y].first, drum[x][y].second);
}

int main() {
  ios_base::sync_with_stdio(0);

  cin >> n >> k;
  for(i = 1; i <= n; ++i) {
    cin >> name[i]; id[i] = i;
    for(j = 1; j <= k; ++j) cin >> a[j];

    for(j = 3; j <= k; ++j)
      if(a[j - 2] < a[j - 1] && a[j - 1] < a[j]) v[i][j] = 1, ++sz[i];
  }

  for(i = 1; i <= k; ++i) ans[i] = "none";

  sort(id + 1, id + n + 1, [](int a, int b) { return sz[a] < sz[b]; });

  for(i = 1; i <= n; ++i) 
    for(j = 1; j <= k; ++j) {
      if(!v[id[i]][j]) continue;

      dp[i][j] = 1;
      for(x = 1; x < i; ++x)
        for(y = 1; y < j; ++y)
          if(dp[i][j] < dp[x][y] + 1) {
            dp[i][j] = dp[x][y] + 1;
            drum[i][j] = make_pair(x, y);
            if(dp[rsx][rsy] < dp[i][j]) rsx = i, rsy = j;
          }
    }

  get_ans(rsx, rsy);

  for(i = 1; i <= k; ++i) cout << ans[i] << '\n';

  return 0;
}