#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using LL=__int128;
using namespace std;const int N=5000+5,M=(1<<15)+5,K=(1<<20)+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,seed,A[N*2][N],vis[N*2][2],p[N],tg[N];
void gen(int n,int seed){
    std::mt19937 rnd(seed);
    for(int i=1;i<=n;++i){
        for(int j=1;j<=n+1;++j){
            A[i][j]=j;
            std::swap(A[i][j],A[i][rnd()%j+1]);
        }
    }
}
int main(){
	int i,j,h;scanf("%d%d",&n,&seed);
	if(!seed) for(i=1;i<=n;i++) for(j=1;j<=n+1;j++) scanf("%d",&A[i][j]);
	else gen(n,seed);
	for(i=n+1;i<=2*n;i++) for(j=1;j<=n+1;j++) A[i][j]=A[i-n][j];
	for(i=2*n;i;i--){
		fill(vis[i]+1,vis[i]+n+2,1);
		for(j=1;j<=n+1;j++) p[A[i][j]]=j;
		int R=i;
		for(j=1;j<=n+1;j++) {
			while(R<=2*n&&R<i+n&&A[R][p[j]]) A[R][p[j]]=0;R++;
		}
	}
	for(i=1;i<=n+1;i++) if(A[2*n][i]) printf("%d ",i);
	for(i=n+1;i<2*n;i++) for(j=1;j<=n+1;j++) if(A[i][j]) printf("%d ",j);
}