#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=2e3;

int n,m,a[Maxn+5][Maxn+5],cnt[Maxn+5],vis[Maxn+5];
vector<int> v[Maxn+5];

inline void Clear()
{
    For(i,1,m) cnt[i]=vis[i]=0;
    For(i,1,n) vector<int>().swap(v[i]);
}
inline void Solve()
{
    For(i,1,n) For(j,1,m) cin>>a[i][j];
    For(j,1,m) For(i,1,n-1) if(a[i][j]>a[i+1][j])
        cnt[j]++,v[i].push_back(j);
    vector<int> ans; For(_,1,m)
    {
        int p=-1; For(i,1,m) if(!cnt[i] && !vis[i]) {p=i; break;}
        if(p==-1) {cout<<-1<<endl; Clear(); return;}
        vis[p]=1,ans.push_back(p);
        For(i,1,n-1) if(a[i][p]<a[i+1][p])
        {
            for(auto k:v[i]) cnt[k]--;
            vector<int>().swap(v[i]);
        }
    } for(auto i:ans) cout<<i<<' '; cout<<endl; Clear();
}

int main()
{
    // freopen("1.in","r",stdin);

    ios::sync_with_stdio(false);
    while(cin>>n>>m) Solve();
    return 0;
}