#include<bits/stdc++.h>
using namespace std;
const int N=5e3+3;
int a[N][N];
void gen(int n,int seed){
    std::mt19937 rng(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][rng()%j+1]);
        }
    }
}
int n,seed;
int b[N][N];
bitset<N>vis;
int main(){
    int u,v,w,x,y,z;
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n>>seed;
    if(!seed)for(int i=1;i<=n;++i)for(int j=1;j<=n+1;++j)cin>>a[i][j];
    else gen(n,seed);
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n+1;++j)
            b[i][a[i][j]]=j;
    // for(int i=1;i<=n;++i,puts(""))
    //     for(int j=1;j<=n+1;++j)
    //         printf("%d ",b[i][j]);
    for(int i=1;i<=n;++i){
        for(int i=1;i<=n+1;++i)vis[i]=0;
        for(int j=1;j<=n;++j){
            int k=1;while(vis[b[(i+j-1)%n+1][k]])++k;
            // printf("%d ",b[(i+j-1)%n+1][k]);
            vis[b[(i+j-1)%n+1][k]]=1;
        }
        // puts("");
        for(int j=1;j<=n+1;++j)
            if(!vis[j]){printf("%d ",j);break;}
    }
    puts("");
    return 0;
}