#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
#define bp __builtin_parity
#define y1 yyl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef bitset<1009> bset;

int read() {
	int x=0,w=1; char c=getchar();
	while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
	while(isdigit(c)) {x=x*10+c-'0'; c=getchar();}
	return x*w;
}

const int N=5009;
int b[N][N],a[N][N],n,seed;
int lst(int x) {return x==1?n:x-1;}

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]);
        }
    }
}

void work(int p) {
	for(int x=lst(p);;x=lst(x)) {
		int p1=0, p2=0, rc=0;
		rep(i,1,n+1) {
			if(b[x][i]==1) p1=i;
			else if(b[x][i]==2) p2=i;
		}
		for(int y=lst(x);y!=lst(p);y=lst(y)) {
			rep(j,1,n+1) {
				if(b[y][j]>b[y][p1]) b[y][j]--;
			}
			b[y][p1]=0;
		}
		if(x==p) {
			printf("%d ",p2);
			return;
		}
	}
}

signed main() {
	n=read(), seed=read();
	if(seed) gen(n,seed);
	else rep(i,1,n) rep(j,1,n+1) a[i][j]=read();
	rep(i,1,n) {
		rep(j,1,n) rep(k,1,n+1) b[j][k]=a[j][k];
		work(i);
	} putchar('\n');
	return 0;
}