#include <bits/stdc++.h>
using namespace std;
vector<int> adj[400010];
int clk, tme[400010];
void dfs(int i) {
  tme[i] = -1;
  clk++;
  for (int j = adj[i].size() - 1; j + 1; j--) {
    if (!(tme[adj[i][j]] + 1)) {
      printf("-1");
      exit(0);
    }
    if (!tme[adj[i][j]]) dfs(adj[i][j]);
  }
  tme[i] = clk;
  clk++;
}
int main(void) {
  int n, m;
  scanf("%d%d", &n, &m);
  getchar();
  int vir = m + 2;
  for (int i = 1; i <= n; i++) {
    vector<pair<int, int> > v;
    for (int j = 1; j <= m; j++) {
      int t;
      scanf("%d", &t);
      if (t == -1) continue;
      v.push_back(make_pair(t, j));
    }
    if (v.empty()) continue;
    getchar();
    sort(v.begin(), v.end());
    int lst = 0;
    for (int i = 0, sz = v.size(); i < sz; i++) {
      if (v[i].first != v[lst].first) vir++, lst = i;
      adj[vir - 1].push_back(v[i].second);
      adj[v[i].second].push_back(vir);
    }
    vir++;
    vir++;
  }
  for (int i = 1; i <= m; i++) {
    if (!tme[i]) dfs(i);
  }
  vector<pair<int, int> > v;
  for (int i = 1; i <= m; i++) {
    v.push_back(make_pair(-tme[i], i));
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < m; i++) {
    printf("%d ", v[i].second);
  }
  return 0;
}
