#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128 LL;
typedef pair<int,int> pii;
const int MAXN = 2e3 + 5;

using Data = pair<ll,int>;

LL cmp(Data A,Data B)
{
	return (LL)A.first * B.second - (LL)A.second * B.first;
}

int a[MAXN][MAXN];
Data p[MAXN][MAXN];

int main(void)
{
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=1; i<=n; ++i)
		for(int j=1; j<=m; ++j)
			scanf("%d",&a[i][j]);
	
	for(int k=1; k<=n; ++k)
	{
		ll need = accumulate(a[k]+1, a[k]+m+1, 0ll);
		ll sum = 0;
		for(int i=1,j=1; i<=n; ++i)
		{
			ll cur = need * i;
			while(sum + (ll)a[j] * n < cur)
				sum += (ll)a[j] * n, ++j;
			
			p[k][i] = {cur - sum + ll(j-1) * n * a[k][j], n * a[k][j]};
		}
	}
	
	static int id[MAXN];
	static bool vis[MAXN];
	for(int i=1; i<=n; ++i)
	{
		Data mn = {-1, -1};
		for(int j=1; j<=n; ++j)
			if(!vis[j] && (mn.first == -1 || cmp(p[j][i], mn) < 0))
			{
				id[i] = j;
				mn = p[j][i];
			}
		vis[id[i]] = 1;
		
		if(i < n)
			printf("%lld %d\n",mn.first,mn.second);
	}
	for(int i=1; i<=n; ++i)
		printf("%d ",id[i]);
	return 0;
}