#include <bits/stdc++.h>
using namespace std;
const int N = 5005;

inline int read() {
	char ch = getchar(); int x = 0;
	while (!isdigit(ch)) {ch = getchar();};
	while (isdigit(ch)) {x = x * 10 + ch - 48; ch = getchar();}
	return x;
}

int a[N][N];

void gen(int n, int seed) {
	mt19937 rnd(seed);
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n + 1; ++j) {
			a[i][j] = j;
			swap(a[i][j], a[i][rnd() % j + 1]);
		}
}

int n, seed;
bool vis[N];

int main() {
	n = read(); seed = read();
	if (seed) gen(n, seed);
	else {
		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= n + 1; ++j)
				a[i][j] = read();
	}
	for (int p = 1; p <= n; ++p) {
		for (int ans = n + 1; ans >= 1; --ans) {
			for (int i = 1; i <= n + 1; ++i) vis[i] = false;
			int cnt = 1; bool pd = true;
			for (int i = 1, x = p + 1; i < n; ++i, ++x) {
				if (x > n) x -= n;
				for (int j = n + 1;; --j) {
					if (a[x][j] == a[p][ans]) break;
					if (!vis[a[x][j]]) cnt--, vis[a[x][j]] = true;
				}
				if (cnt < 0) {pd = false; break;}
				cnt++;
			}
			if (pd) {printf("%d ", a[p][ans]); break;}
		}
	}
	return 0;
}