#include <bits/stdc++.h>
#define int long long
using namespace std;
const int NMAX=2000;
int n, l, used[NMAX+5], v[NMAX+5];
vector <vector <int>> sep[NMAX+5];
bool cmp (vector <int> a, vector <int> b)
{
if (a[0]!=b[0])
return a[0]<b[0];
return a[1]*b[2]<a[2]*b[1];
}
signed main ()
{
ios_base :: sync_with_stdio (0);
cin.tie (nullptr);
cin >> n >> l;
for (int i=1;i<=n;i++)
{
int sum=0;
for (int j=0;j<l;j++)
{
cin >> v[j];
sum+=v[j];
}
int crt=0, k=0;
for (int j=1;j<n;j++)
{
while (k<l && (crt+v[k])*n<=sum*j)
crt+=v[k++];
sep[i].push_back ({k, sum*j-crt*n, v[k]*n});
}
sep[i].push_back ({l, 0ll, 1ll});
}
vector <vector <int>> ans;
vector <int> p;
for (int i=0;i<n;i++)
{
int nxt=-1;
for (int j=1;j<=n;j++)
{
if (used[j])
continue;
if (nxt==-1 || cmp (sep[j][i], sep[nxt][i]))
nxt=j;
}
used[nxt]=1;
ans.push_back (sep[nxt][i]);
p.push_back (nxt);
}
ans.pop_back ();
for (auto chestie : ans)
cout << chestie[0]*chestie[2]+chestie[1] << " " << chestie[2] << "\n";
for (auto chestie : p)
cout << chestie << " ";
return 0;
}
