#include<bits/stdc++.h>
using namespace std;
inline int read()
{
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int pp[4000005];
int las[10000005];
vector<int>v[2000005];
int xl[10000005],cnt;
int nxl[10000005],ncnt;
mt19937 ran(121296);
int main()
{
	int n,d,x;
	n=read();
	d=read();
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=d;j++)
		{
			x=read()+n;
			v[i].push_back(x);
			v[x].push_back(i);
		}
	}
	for(int i=1;i<=n;i++)pp[i]=-1;
	for(int i=1;i<=n;i++)
	{
		int now=ran()%n+1;
		while(pp[now]!=-1)now=ran()%n+1;
		cnt=0;
		xl[++cnt]=now;
		//printf("???%d\n",now);
		while(1)
		{
			int sth=ran()%d;
			while(sth==pp[now])sth=ran()%d;
			xl[++cnt]=sth;
			int gre=v[now][sth];
			if(pp[gre]==0)break;
			xl[++cnt]=pp[gre];
			now=pp[gre];
		}
		//printf("orz\n");
		for(int i=1;i<=cnt;i+=2)
		{
			las[xl[i]]=i;
		}
		ncnt=0;
		for(int i=1;i<=cnt;i++)
		{
			nxl[++ncnt]=xl[i]; 
			if(i%2==1)i=las[xl[i]];
		}
		//for(int i=1;i<=ncnt;i++)printf("%d ",nxl[i]);
	//	printf("\n");
		for(int i=1;i<=ncnt;i+=2)
		{
			pp[nxl[i]]=nxl[i+1];
			pp[v[nxl[i]][nxl[i+1]]]=nxl[i];
		}
		/*for(int i=1;i<=2*n;i++)printf("%d ",pp[i]);
		printf("\n");
		printf("orzfin\n");*/
	}
	for(int i=1;i<=n;i++)printf("%d ",v[i][pp[i]]-n);
	return 0;
}