#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T &x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T &x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
mt19937 mrand(chrono::steady_clock::now().time_since_epoch().count());
const int N = 2e6 + 10;
int n, d;
vector <int> e[N];
bool vis[N];
int tor[N], ans[N];
vector <int> id;
signed main() {
	read(n), read(d);
	F(i, 1, n) {
		id.push_back(i);
		e[i].resize(d);
		for (int &j: e[i]) read(j);
	}
	shuffle(all(id), mrand);
	for (int i: id) {
		int x = i;
		vector <int> sta;
		while (x) {
			int y;
			do
				y = e[x][mrand() % e[x].size()];
			while (tor[y] == x);
			while (vis[y]) {
				vis[sta.back()] = false;
				sta.pop_back();
			}
			vis[y] = true;
			sta.push_back(y);
			x = tor[y];
		}
		int pos = i;
		for (int j: sta) swap(pos, tor[j]), vis[j] = false;
	}
	F(i, 1, n) ans[tor[i]] = i;
	F(i, 1, n) cout << ans[i] << ' ';
	return 0;
}
/* why?
*/