#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

typedef long long ll;

int main() {
	ll n, k;
	cin >> n >> k;
	vector<pair<ll, ll> > sums(n);
	vector<vector<ll> > inp(k);;
	for(ll i = 0; i < n; i++)
		sums[i].second = i;
	for(ll i = 0; i < k; i++){
		for(ll j = 0; j < n; j++){
			ll p;
			cin >> p;
			//inp[i].push_back(p);
			sums[p-1].first += j;
		}
	}
	sort(sums.begin(), sums.end());
	//vector<ll> tau(n);
	//for(int i = 0; i < n; i++)
	//	tau[sums[i].second] = i+1;
	//ll cost = 0;
	//for(ll i = 0; i < k; i++)
	//	for(ll j = 0; j < n; j++)
	//		cost += (tau[j]-inp[i][j])*(tau[j] - inp[i][j]);
	//cout << cost << endl;
	for(ll i = 0; i < n; i++) {
		if (i) cout << " ";
		cout << sums[i].second + 1;
	}
	cout << endl;

	return 0;
}