#include<bits/stdc++.h>
using namespace std;
//#define int long long
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef double db;
#define F(i, a, b) for(int i = a; i <= (b); ++i)
#define F2(i, a, b) for(int i = a; i < (b); ++i)
#define dF(i, a, b) for(int i = a; i >= (b); --i)
template<typename T> void debug(string s, T x) {cerr << "[" << s << "] = [" << x << "]\n";}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {for (int i = 0, b = 0; i < (int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++;else if (s[i] == ')' || s[i] == '}') b--;else if (s[i] == ',' && b == 0) {cerr << "[" << s.substr(0, i) << "] = [" << x << "] | ";debug(s.substr(s.find_first_not_of(' ', i + 1)), args...);break;}}
#ifdef ONLINE_JUDGE
#define Debug(...)
#else
#define Debug(...) debug(#__VA_ARGS__, __VA_ARGS__)
#endif
#define pb push_back
#define fi first
#define se second
#define Mry fprintf(stderr, "%.3lf MB\n", (&Med - &Mbe) / 1048576.0)
#define Try cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
typedef long long ll;
// namespace Fread {const int SIZE = 1 << 17; char buf[SIZE], *S, *T; inline char getchar() {if (S == T) {T = (S = buf) + fread(buf, 1, SIZE, stdin); if (S == T) return '\n';} return *S++;}}
// namespace Fwrite {const int SIZE = 1 << 17; char buf[SIZE], *S = buf, *T = buf + SIZE; inline void flush() {fwrite(buf, 1, S - buf, stdout), S = buf;} inline void putchar(char c) {*S++ = c;if (S == T) flush();} struct NTR {~NTR() {flush();}} ztr;}
// #ifdef ONLINE_JUDGE
// #define getchar Fread::getchar
// #define putchar Fwrite::putchar
// #endif
inline int ri() {
	int x = 0;
	bool t = 0;
	char c = getchar();
	while (c < '0' || c > '9') t |= c == '-', c = getchar();
	while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
	return t ? -x : x;
}
inline void wi(int x) {
	if (x < 0) {
		putchar('-'), x = -x;
	}
	if (x > 9) wi(x / 10);
	putchar(x % 10 + 48);
}
inline void wi(int x, char s) {
	wi(x), putchar(s);
}
bool Mbe;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll infll = 0x3f3f3f3f3f3f3f3f;
const int N = 4e6 + 5;
int ans ;
int n, m ;
int vis[N] ;
int match[N] ;
vi E[N];
clock_t st ;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
db now_time(){
	return (double)(clock() - st) / CLOCKS_PER_SEC ;
}

int do_match(int x){
//	cout << x << ' ' ;
	shuffle(E[x].begin(), E[x].end(), rnd) ; vis[x] = 1 ;
	for (auto y : E[x])
		if (!match[y])
			return vis[x] = 0, match[y] = x, match[x] = y, 1;
	for (auto y : E[x]){
		int z = match[y] ;
		if (vis[z]) continue;
		match[x] = y, match[y] = x, match[z] = 0 ;
		if (do_match(z)) return vis[x] = 0, 1;
		match[y] = z, match[z] = y, match[x] = 0 ;
	}
	return vis[x] = 0, 0;
}
int main(){
//	freopen("P6113_1.in", "r", stdin);
	st = clock() ;
	cin >> n >> m ; int x, y, z ;
	F(i, 1, n) {
		F(j, 1, m) {
			x = ri();
			E[i].pb(n + x), E[n + x].pb(i);
		}
	}
//	for (int i = 1 ; i <= m ; ++ i)
//		x = ri(), y = ri(), E[x].pb(y), E[y].pb(x);
	while (now_time() < 0.55){
		for (int i = 1 ; i <= n ; ++ i)
			if (!match[i])
				ans += do_match(i);
		if(ans == n) break;
	}
//	cout << ans << '\n' ;
	F(i, 1, n) printf("%d ", match[i] - n);
	cout << '\n';
	return 0 ;
}