#include <bits/stdc++.h>
using namespace std;
inline bool isvowel(char c) {
  c = tolower(c);
  if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u')
    return 1;
  return 0;
}
const double eps = 0.000001;
const long double pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const long long MOD = 1e18 + 9;
const long long INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;
const int M = 22;
const int pri = 997;
const int Magic = 2101;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int n, m, k;
int u[N];
int lst[N];
vector<int> g[N];
vector<int> st;
pair<int, int> a[N];
void dfs(int v) {
  u[v] = 1;
  for (auto to : g[v]) {
    if (!u[to]) {
      dfs(to);
    } else if (u[to] == 1) {
      cout << -1;
      exit(0);
    }
  }
  st.push_back(v);
  u[v] = 2;
}
int main() {
  cin >> n >> m;
  a[0].first = -1;
  int lst = m;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= m; j++) {
      cin >> a[j].first;
      a[j].second = j;
    }
    sort(a + 1, a + m + 1);
    for (int i = 1; i <= m; i++) {
      if (a[i].first == -1) continue;
      if (a[i].first != a[i - 1].first) lst++;
      g[lst].push_back(a[i].second);
      g[a[i].second].push_back(lst + 1);
    }
    lst++;
  }
  for (int i = 1; i <= lst; i++)
    if (!u[i]) dfs(i);
  reverse(st.begin(), st.end());
  for (int i : st) {
    if (i <= m) cout << i << ' ';
  }
  return 0;
}
