#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
mt19937 eng(363415);
int rnd(int l, int r) { return eng() % (r - l + 1) + l; }
int n, d;
vector<int> e[2000005];
int mat[4000005], id[2000005];
int st[6000005], top;
bool vis[4000005];
int main() {
	scanf("%d%d", &n, &d);
	for (int i = 1; i <= n; i++) {
		e[i].resize(d);
		for (int j = 0; j < d; j++) scanf("%d", &e[i][j]);
		id[i] = i;
	}
	shuffle(id + 1, id + n + 1, eng);
	for (int i = 1; i <= n; i++) {
		int u = id[i];
		st[++top] = u; vis[u] = true;
		while (u) {
			int v;
			do v = e[u][rnd(0, e[u].size() - 1)] + n; while (v == mat[u]);
			while (vis[v]) vis[st[top--]] = false;
			vis[st[++top] = v] = true;
			st[++top] = (u = mat[v]);
		}
		top--;
		for (int i = top; i; i -= 2) {
			int a = st[i], b = st[i - 1];
			mat[a] = b, mat[b] = a;
		}
		while (top) vis[st[top--]] = false;
	}
	for (int i = 1; i <= n; i++) printf("%d%c", mat[i] - n, " \n"[i == n]);
	return 0;
}