#include <bits/stdc++.h>
using namespace std;

#define int long long

const int N=2005;

int a[N][N];

struct fraction
{
	int a,b;

	fraction operator +(const fraction& oth) const
	{
		return (fraction){a*oth.b+b*oth.a,b*oth.b};
	}

	fraction operator -(const fraction& oth) const
	{
		return (fraction){a*oth.b-b*oth.a,b*oth.b};
	}

	fraction operator *(const fraction& oth) const
	{
		return (fraction){a*oth.a,b*oth.b};
	}

	fraction operator /(const fraction& oth) const
	{
		return (fraction){a*oth.b,b*oth.a};
	}

	bool operator <=(const fraction& oth) const
	{
		return a*oth.b<=b*oth.a;
	}
};

fraction p[N][N];
bool vis[N];
int ans[N];

signed main()
{
	int n,l;
	cin >> n >> l;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=l;j++)
			scanf("%lld",&a[i][j]);

	for(int i=1;i<=n;i++)
	{
		int sum=0;
		for(int j=1;j<=l;j++)
			sum += a[i][j];

		int pos=0, tot=0;
		for(int k=1;k<n;k++)
		{
			while((fraction){tot+a[i][pos+1],1}<=(fraction){sum*k,n})
				tot += a[i][pos+1], pos++;

			p[i][k]=((fraction){sum*k,n}-(fraction){tot,1})/(fraction){a[i][pos+1],1}+(fraction){pos,1};
		}
	}

	for(int i=1;i<=n;i++)
	{
		int best=0;
		for(int j=1;j<=n;j++)
			if(!vis[j] && (!best || p[j][i]<=p[best][i]))
				best=j;
		
		ans[i]=best, vis[best]=true;
	}

	for(int i=1;i<n;i++)
	{
		p[ans[i]][i].a *= 2, p[ans[i]][i].b *= 2;
		printf("%lld %lld\n",p[ans[i]][i].a,p[ans[i]][i].b);
	}

	for(int i=1;i<=n;i++)
		printf("%lld ",ans[i]);
	return 0;
}