#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair 
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 2000005
#define inf 0x3f3f3f3f

int n,d,id[maxn];
vi e[maxn];
mt19937_64 rnd(114514);

int tol[maxn],tor[maxn];
int st[maxn*20],tp;
bool vis[maxn];

signed main()
{
//	freopen("match3.in","r",stdin);
	n=read(),d=read();
	For(i,1,n){
		e[i].resize(d);
		for(int&x:e[i])x=read();
	}
	iota(id+1,id+n+1,1),shuffle(id+1,id+n+1,rnd);
	For(_,1,n){
		int u=id[_];
		tp=0;
		int j=u;
		while(j){
			int t=e[j][rnd()%d];
			while(t==tor[j])t=e[j][rnd()%d];
			while(vis[t]) vis[st[tp--]]=0;
			vis[t]=1;
			st[++tp]=t;
			j=tol[t];
		}
		while(tp){
			int u=st[tp],lst=st[tp-1]; --tp;
			tor[tol[lst]]=u;
			tol[u]=tol[lst];
			vis[u]=0;
		}
		tor[u]=st[1];
		tol[st[1]]=u;
	}
	For(i,1,n)printf("%d ",tor[i]);
	return 0;
}