#include <bits/stdc++.h>
#define N 505
using namespace std;
typedef long long ll;

int n, m, bel[N], in[N], lst[N]; ll dis[N];
int col[200005];
vector<int> E[N];
vector<vector<int> > a; 
vector<vector<ll> > b;

int main() {
//	freopen("000.in", "r", stdin);
	scanf("%d %d", &n, &m);
	if (n >= m) {
		for (int i = 1; i <= m; i++) printf("%d ", i);
		return 0;
	}
	a.resize(n+1); b.resize(n+1);
	for (int i = 1; i <= n; i++) a[i].resize(m+1), b[i].resize(m+1);
	for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) 
		scanf("%d", &a[i][j]);
	for (int i = 1; i <= n; i++) bel[i] = i;
	for (int k = 1; k <= m; k++) {
		int p = 0;
		for (int j = 1; j <= n; j++) {
			bool flg = 0;
			for (int i = 1; i <= n; i++) if (b[i][bel[i]] < b[i][bel[j]]) { flg = 1; break; }
			if (!flg) { p = j; break; }
		}
		col[k] = bel[p];
		for (int i = 1; i <= n; i++) {
			b[i][bel[p]] += a[i][k];
			E[i].clear(); in[i] = 0;
		}
		for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) {
			if (j != p && b[i][bel[i]] < b[i][bel[j]]) {
				E[i].push_back(j); ++in[j];
			}
		}
		queue<int> q; memset(lst, 0, sizeof(lst));
		memset(dis, -0x3f, sizeof(dis)); dis[p] = 0;
		for (int i = 1; i <= n; i++) if (!in[i]) q.push(i);
		while (!q.empty()) {
			int x = q.front(); q.pop();
			for (auto y : E[x]) {
				if (dis[y] < dis[x]-b[x][bel[x]]+b[x][bel[y]]) {
					dis[y] = dis[x]-b[x][bel[x]]+b[x][bel[y]];
					lst[y] = x;
				}
				if (!--in[y]) q.push(y);
			}
		}
		int x = 0; ll mx = -1e18;
		for (int i = 1; i <= n; i++) {
			if (b[i][bel[i]] < b[i][bel[p]] && mx < dis[i]-b[i][bel[i]]+b[i][bel[p]]) {
				mx = dis[i]-b[i][bel[i]]+b[i][bel[p]];
				x = i;
			}
		}
		for (int _ = bel[p]; x; x = lst[x]) swap(_, bel[x]);
	}
	for (int i = 1; i <= m; i++) {
		for (int j = 1; j <= n; j++) if (col[i] == bel[j]) {
			printf("%d ", j); break;
		}
	}
	return 0;
}