#include<bits/stdc++.h>
using namespace std;
const int N=2e6+10;
int match[N],inv[N],p[N];
int sta[N*2],top,in[N];
vector<int>to[N];
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    srand(time(0));
    int n,d;cin>>n>>d;
    for(int i=1;i<=n;++i)
    {
        p[i]=i;to[i].resize(d);swap(p[i],p[rand()%i+1]);
        for(int j=0;j<d;++j)cin>>to[i][j];
    }
    for(int i=1;i<=n;++i)
    {
        int u=p[i];
        sta[top=1]=u;
        while(1)
        {
            int v=to[u][rand()%d];
            if(in[v])while(sta[--top]!=v)in[sta[top--]]=0;
            else in[sta[++top]=v]=1;
            if(!match[v])break;
            u=sta[++top]=match[v];
        }
        while(top)
        {
            int v=sta[top--];
            int u=sta[top--];
            in[v]=0;match[v]=u;
        }
    }
    for(int i=1;i<=n;++i)inv[match[i]]=i;
    for(int i=1;i<=n;++i)cout<<inv[i]<<" ";cout<<endl;
}