#include<bits/stdc++.h>
#define ffor(i,a,b) for(int i=(a);i<=(b);i++)
#define roff(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int MAXN=2e6+10;
int n,d,id[MAXN],vis[MAXN],mtl[MAXN],mtr[MAXN];
vector<int> Gl[MAXN],Gr[MAXN]; 
int main() {
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n>>d;
	ffor(i,1,n) ffor(j,1,d) {int u;cin>>u,Gl[i].push_back(u),Gr[u].push_back(i);}
	mt19937 rnd,myrand(time(NULL));
	ffor(i,1,n) id[i]=i;
	shuffle(id+1,id+n+1,rnd);
	ffor(i,1,n) {
		int u=id[i];
		if(mtl[u]) continue ;
		stack<pair<int,int>> st;
		st.push({u,0});
		while(1) {
			int tr=0;
			while(1) {
				int id=myrand()%d;
				if(mtl[u]!=Gl[u][id]) {tr=Gl[u][id];break ;}
			}
			while(vis[tr]) {
				int u=st.top().first,id=st.top().second;	
				if(id) vis[u]=0;
				st.pop(); 
			}
			vis[tr]=1,st.push({tr,1});
			if(!mtr[tr]) break ;
			else u=mtr[tr],st.push({u,0});
			
		}
		while(!st.empty()) {
			int r=st.top().first; st.pop();
			int l=st.top().first; st.pop();
			mtl[l]=r,mtr[r]=l;
			vis[r]=0;	
		}
	}
	ffor(i,1,n) cout<<mtl[i]<<' ';
	return 0;
}