#include <bits/stdc++.h>
using namespace std;
long long pow(long long b, long long e, long long m) {
  long long t = 1;
  for (; e; e >>= 1, b = b * b % m) e & 1 ? t = t * b % m : 0;
  return t;
}
template <class T>
inline bool chkmin(T &a, T b) {
  return a > b ? a = b, true : false;
}
template <class T>
inline bool chkmax(T &a, T b) {
  return a < b ? a = b, true : false;
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <typename T>
T gcd(T x, T y) {
  for (T t; x; t = x, x = y % x, y = t)
    ;
  return y;
}
template <class edge>
struct Graph {
  vector<vector<edge> > adj;
  Graph(int n) {
    adj.clear();
    adj.resize(n + 5);
  }
  Graph() { adj.clear(); }
  void resize(int n) { adj.resize(n + 5); }
  void add(int s, edge e) { adj[s].push_back(e); }
  void del(int s, edge e) { adj[s].erase(find(iter(adj[s]), e)); }
  vector<edge> &operator[](int t) { return adj[t]; }
};
const int maxn = 110000;
vector<int> v;
int perm[maxn], n, m, deg[maxn * 2];
Graph<int> G;
int cmp(const int &a, const int &b) { return v[a] < v[b]; }
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  int tot = m;
  G.resize(n * m * 2);
  for (int i = 1; i <= n; ++i) {
    v.clear(), v.resize(m + 1);
    for (int j = 1; j <= m; ++j) {
      perm[j] = j;
      cin >> v[j];
    }
    sort(perm + 1, perm + m + 1, cmp);
    for (int j = 1, p = -1; j <= m;) {
      int x = v[perm[j]], q = ++tot;
      for (; j <= m && v[perm[j]] == x; ++j) {
        if (x == -1) continue;
        if (p > 0) G.add(p, perm[j]);
        G.add(perm[j], q);
      }
      p = q;
    }
  }
  for (int v = 1; v <= tot; ++v) {
    for (auto &u : G[v]) {
      ++deg[u];
    }
  }
  queue<int> Q;
  for (int v = 1; v <= tot; ++v) {
    if (deg[v] == 0) {
      Q.push(v);
    }
  }
  vector<int> ans;
  for (; !Q.empty();) {
    int v = Q.front();
    Q.pop();
    for (auto &u : G[v]) {
      if (--deg[u] == 0) {
        Q.push(u);
      }
    }
    if (v <= m) {
      ans.push_back(v);
    }
  }
  for (int v = 1; v <= tot; ++v) {
    if (deg[v]) {
      cout << -1 << endl;
      return 0;
    }
  }
  for (auto &x : ans) {
    cout << x << " ";
  }
  return 0;
}
