#include <bits/stdc++.h>
#define db double
#define il inline
#define re register
#define ll long long
#define ui unsigned
#define ull ui ll
#define i128 __int128
#define pii pair<int, int>
#define fi first
#define se second
#define eb emplace_back
#define SZ(v) (int)v.size()
#define ALL(v) v.begin(), v.end()
#define mems(v, x) memset(v, x, sizeof(v))
#define memc(a, b) memcpy(a, b, sizeof(a))
#define FOR(i, L, R) for(re int i = (L); i <= (R); ++i)
#define ROF(i, R, L) for(re int i = (R); i >= (L); --i)
#define LS i << 1, l, mid
#define RS i << 1 | 1, mid + 1, r
#define popc(x) __builtin_popcount(x)
using namespace std;
#define N 2005
#define P 1000000007
il int add(int x, int y) {return x + y < P ? x + y : x + y - P;}
il void addr(int &x, int y) {(x += y) >= P && (x -= P);}
il int qpow(int p, int n = P - 2) {
  int s = 1;
  while(n) {
    if(n & 1) s = 1ll * s * p % P;
    p = 1ll * p * p % P, n >>= 1;
  }
  return s;
}
int n, m, a[N][N], cnt[N], ans[N];
vector<int> p[N]; bool u[N];
il void WORK() {
  FOR(i, 1, n) {
    FOR(j, 1, m) cin >> a[i][j];
    vector<int>().swap(p[i]), u[i] = 0;
  }
  priority_queue<int, vector<int>, greater<int>> Q;
  FOR(i, 1, m) {
    cnt[i] = 0;
    FOR(j, 1, n - 1) if(a[j][i] > a[j + 1][i])
      ++cnt[i], p[j].eb(i);
    if(!cnt[i]) Q.emplace(i);
  }
  FOR(i, 1, m) {
    // cerr << i << "\n";
    if(Q.empty()) {cout << "-1\n"; return ;}
    int x = Q.top(); ans[i] = x, Q.pop();
    FOR(i, 1, n - 1) if(!u[i] && a[i][x] < a[i + 1][x]) {
      u[i] = 1; for(auto j : p[i]) if(!--cnt[j]) Q.emplace(j);
    }
  }
  FOR(i, 1, m) cout << ans[i] << " \n"[i == m];
}
int main() {
  freopen("1.txt", "r", stdin);
  freopen("2.txt", "w", stdout);
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  while(cin >> n >> m) WORK();
  cerr << 1.0 * clock() / CLOCKS_PER_SEC;
  return 0;
}