#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define NMAX 110
#define KMAX 110

string name[NMAX], sol[KMAX];
int v[KMAX];
bool ok[NMAX][KMAX], used[NMAX];

int main()
{
	#ifndef ONLINE_JUDGE
	freopen("data.in", "r", stdin);
	freopen("data.out", "w", stdout);
	#endif

	int i, j, n, k;

	cin >> n >> k;
	for(i = 0; i < n; ++i)
	{
		cin >> name[i];
		for(j = 0; j < k; ++j) cin >> v[j];
		for(j = 0; j + 2 < k; ++j)
			if(v[j] < v[j + 1] && v[j + 1] < v[j + 2])
				ok[i][j + 2] = true;
	}

	for(i = k - 1; i >= 0; --i)
	{
		for(j = 0; j < n; ++j)
			if(ok[j][i] && !used[j])
			{
				sol[i] = name[j];
				used[j] = true;
				break;
			}

		if(sol[i].empty()) sol[i] = "none";
	}

	for(i = 0; i < k; ++i)
		cout << sol[i] << '\n';
	
	return 0;
}