//Shirasu Azusa 2024.7
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii;  
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} 
  return x*w;
}

const int N=4e6+5;
int n,d,p[N],id[N],vst[N],q[N];
vi e[N];

signed main() {
  n=read(), d=read();
  rep(i,1,n) e[i].resize(d);
  rep(i,1,n) rep(j,0,d-1) e[i][j]=read()+n;
  rep(i,1,n) id[i]=i; mt19937 rnd;
  shuffle(id+1,id+n+1,rnd);
  rep(tt,1,n) {
    int s=id[tt]; static int st[N]; int top=0;
    for(int u=s;u;) {
      while(vst[u]) {int x=st[top]; vst[x]=0; --top;}
      vst[u]=1; st[++top]=u;
      int v=e[u][rnd()%d]; while(u==p[v]) v=e[u][rnd()%d];
      while(vst[v]) {int x=st[top]; vst[x]=0; --top;}
      vst[v]=1; st[++top]=v; u=p[v];
    }
    for(int i=1;i<=top;i+=2) p[st[i]]=st[i+1], p[st[i+1]]=st[i];
    rep(i,1,top) vst[st[i]]=0;
  }
  rep(i,1,n) printf("%d ",p[i]-n); puts("");
  return 0;
}