# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128 lll;
struct Frac
{
	ll a,b;
	Frac(ll _a=0,ll _b=0):a(_a),b(_b){}
	bool operator<(const Frac &x)const{return (lll)a*x.b<(lll)b*x.a;}
}a[2010][2010];
int V[2010][2010],S[2010],p[2010];
bool del[2010];
int main()
{
	int n,L;
	cin>>n>>L;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=L;j++)
			scanf("%d",&V[i][j]),S[i]+=V[i][j];
	for(int i=1;i<=n;i++)
		for(int j=1,k=1,s=0;j<n;j++)
		{
			for(;k<=L && n*(s+V[i][k])<=j*S[i];k++) s+=V[i][k];
			a[i][j]=Frac(j*S[i]-n*s+(ll)(k-1)*n*V[i][k],n*V[i][k]);
		}
	for(int i=1;i<n;i++)
	{
		for(int j=1;j<=n;j++)
			if(!del[j] && (!p[i] || a[j][i]<a[p[i]][i])) p[i]=j;
		printf("%lld %lld\n",a[p[i]][i].a,a[p[i]][i].b);
		del[p[i]]=1;
	}
	for(int i=1;i<=n;i++)
		if(!del[i]) p[n]=i;
	for(int i=1;i<=n;i++) printf("%d%c",p[i]," \n"[i==n]);
	return 0;
}