#include <bits/stdc++.h>
using namespace std;
int n, m, x, d[200020], v[200020], cnt;
vector<int> a[200020];
int z[200020], zc;
void add(int x, int y) {
  a[x].push_back(y);
  d[y]++;
}
void ts() {
  queue<int> q;
  for (int i = 1; i <= cnt; i++)
    if (d[i] == 0) q.push(i), v[i] = 1;
  while (q.size()) {
    int u = q.front();
    q.pop();
    if (u <= m) z[zc++] = u;
    for (__typeof(a[u].begin()) i = a[u].begin(); i != a[u].end(); i++)
      if (!--d[*i]) q.push(*i), v[*i] = 1;
  }
  if (zc != m)
    cout << -1 << endl;
  else {
    for (int i = 0; i < zc; i++) printf("%d ", z[i]);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  cnt = m;
  for (int i = 0; i < n; i++) {
    map<int, vector<int> > g;
    for (int j = 1; j <= m; j++) {
      scanf("%d", &x);
      if (~x) g[x].push_back(j);
    }
    int l = -1;
    for (__typeof(g.begin()) j = g.begin(); j != g.end(); j++) {
      if (~l)
        for (__typeof(j->second.begin()) k = j->second.begin();
             k != j->second.end(); k++)
          add(l, *k);
      l = ++cnt;
      for (__typeof(j->second.begin()) k = j->second.begin();
           k != j->second.end(); k++)
        add(*k, l);
    }
  }
  ts();
  return 0;
}
