#include<bits/stdc++.h>
#define int long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
int n,m;
const int Maxn=2e3+10;
int a[Maxn][Maxn];
vector<int> vc[Maxn];
int vis[Maxn];
int d[Maxn];
priority_queue<int,vector<int> ,greater<int> > q;
vector<int> ans;
inline void work(){
    vector<int> ().swap(ans);
    while(!q.empty()) q.pop();
    fr(i,1,n) fr(j,1,m) a[i][j]=read();
    fr(i,1,n) vc[i].clear();
    fr(i,1,m) d[i]=0;
    fr(i,2,n) vis[i]=0;
    fr(j,1,m) fr(i,2,n) if(a[i][j]<a[i-1][j]) ++d[j],vc[i].push_back(j);
    fr(i,1,m) if(!d[i]) q.push(i);
    while(!q.empty()){
        int x=q.top();q.pop();ans.push_back(x);
        fr(i,2,n) if(a[i][x]>a[i-1][x] && !vis[i]){
            vis[i]=1;
            for(auto y:vc[i]){
                --d[y];if(d[y]==0) q.push(y);
            }
        }
    }
    if(ans.size()!=m){
        writeln(-1);
        return;
    }
    for(auto x:ans) writepl(x);puts("");
}
inline void init(){
    while(cin>>n>>m) work();
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}