#include <bits/stdc++.h>
using namespace std;
const int MAX = 100000 + 5;
vector<int> adj[3 * MAX];
int lst[MAX];
vector<int> arr[MAX];
int indeg[3 * MAX];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<pair<int, int>> v;
  vector<int> ans;
  int lstimag = m - 1;
  for (int i = 0; i < n; i++) {
    v.clear();
    for (int j = 0; j < m; j++) {
      int x;
      cin >> x;
      arr[i].push_back(x);
      if (x >= 0) v.push_back(make_pair(x, j));
    }
    sort(v.begin(), v.end());
    for (int i = 0; i < v.size(); i++) {
      if (i == 0 || v[i].first != v[i - 1].first) lstimag++;
      adj[v[i].second].push_back(lstimag + 1),
          adj[lstimag].push_back(v[i].second);
    }
    lstimag++;
  }
  for (int i = 0; i <= lstimag; i++)
    for (int j = 0; j < adj[i].size(); j++) indeg[adj[i][j]]++;
  queue<int> q;
  for (int i = 0; i <= lstimag; i++)
    if (indeg[i] == 0) q.push(i);
  while (q.size()) {
    int cur = q.front();
    q.pop();
    for (int i = 0; i < adj[cur].size(); i++) {
      indeg[adj[cur][i]]--;
      if (indeg[adj[cur][i]] == 0) q.push(adj[cur][i]);
    }
    if (cur >= m) continue;
    ans.push_back(cur + 1);
    for (int i = 0; i < n; i++)
      if (arr[i][cur] != -1)
        lst[i] = arr[i][cur];
      else
        arr[i][cur] = lst[i];
  }
  if (ans.size() != m)
    cout << -1 << "\n";
  else {
    for (int i = 0; i < ans.size(); i++)
      cout << ans[i] << " \n"[i + 1 == ans.size()];
  }
  return 0;
}
