#include <bits/stdc++.h>
#define PR(x) printf(x ? "YES\n" : "NO\n")
#define pr(x) printf(x ? "Yes\n" : "No\n")
#define mk make_pair
#define pb emplace_back
#define fi first
#define se second
#define pii pair<int, int>
#define fore(i, u, v) for (int i = h[u], v = e[i].v; i; v = e[i = e[i].nxt].v)
#define all(x) x.begin(), x.end()

using namespace std;
inline int read() {
	int x = 0, f = 1;
	char ch = getchar();
	while (! isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); }
	while (isdigit(ch)) { x = x * 10 + ch - 48; ch = getchar(); }
	return x * f;
}

const int maxn = 5e3 + 10;

int n, seed, w[maxn], id[maxn];
bool vi[maxn]; int a[maxn][maxn], b[maxn][maxn];

void gen(){
    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 main() {

	n = read(), seed = read();
	if (!seed) {
		for (int i = 1; i <= n; i ++)
			for (int j = 1; j <= n + 1; j ++) a[i][j] = read();
	} else gen();

	for (int i = 1; i <= n; i ++)
		for (int j = 1; j <= n + 1; j ++) b[i][a[i][j]] = j;

	for (int i = n; i; i --) {
		w[i] = 1;
		while (vi[b[i][w[i]]]) w[i] ++;
		vi[b[i][w[i]]] = 1; 
	}

	for (int i = 1; i <= n; i ++) id[i] = i;
	for (int i = 1; i <= n; i ++) {
		int t = 1; while (vi[t]) t ++;
		printf("%d ", t);

		int p = id[1];
		rotate(id + 1, id + 2, id + n + 1);
		fill(vi + 1, vi + n + 2, 0);

		vi[b[p][w[p] = 1]] = 1;
		for (int j = 1; j < n; j ++) {
			p = id[j];
			while (vi[b[p][w[p]]]) w[p] ++;
			vi[b[p][w[p]]] = 1;
		}
	}
	
	return 0;
}