#include <bits/stdc++.h>

using namespace std;

const int MAXN=5010;
int a[MAXN][MAXN], ord[MAXN][MAXN], p[MAXN];
bool vis[MAXN];
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 main()
{
	int n, seed, i, j, k;
	scanf("%d%d", &n, &seed);
	if(seed)
		gen(n, seed);
	else
		for(i = 1; i <= n; i++)
			for(j = 1; j <= n + 1; j++)
				scanf("%d", a[i] + j);
	for(i = 1; i <= n; i++)
	{
		for(j = 1; j <= n + 1; j++)
			ord[i][a[i][j]] = j;
		p[i] = 1;
	}
	for(i = n; i >= 1; i--)
	{
		for(j = n + 1; j >= 1; j--)
			vis[j] = 0, p[j] = 1;
		for(j = n; j >= 1; j--)
		{
			k = (i + j - 1) % n + 1;
			while(vis[ord[k][p[k]]])
				p[k]++;
			vis[ord[k][p[k]]] = 1;
		}
		for(j = 1; j <= n + 1; j++)
			if(!vis[j])
				printf("%d ", j);
	}
	printf("\n");
	return 0;
}