#include <bits/stdc++.h>
using namespace std;
using nagai = long long;
#define sz(x) int((x).size())
const int N=2020;
int n,m;
nagai matr[N][N];
nagai pref[N][N];
struct frac{
nagai a,b;
void check(){
if(a==0)return;
nagai g=__gcd((unsigned long long)a,(unsigned long long)b);
a/=g;
b/=g;
}
frac(nagai a,nagai b):a(a),b(b){
check();
}
frac(nagai x):a(x),b(1){}
frac operator *(frac o){
return frac(a*o.a,b*o.b);
}
frac operator +(frac o){
return frac(a*o.b+o.a*b,b*o.b);
}
frac operator -(frac o){
return frac(a*o.b-o.a*b,b*o.b);
}
bool operator <=(frac o){
return a*o.b<=b*o.a;
}
bool operator <(frac o){
return a*o.b<b*o.a;
}
};
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m;
for(int i=0;i<n;++i)
for(int j=0;j<m;++j)
cin>>matr[i][j],pref[i][j+1]=pref[i][j]+matr[i][j];
frac cur(0);
vector<frac>fr;
vector<int>ord;
vector<bool>used(n);
for(int i=0;i<n;++i){
frac mn(10000);
int mni=-1;
for(int j=0;j<n;++j){
if(used[j])continue;
int lb=cur.a/cur.b;
frac kek=frac(matr[j][lb])*frac(cur.a%cur.b,cur.b);
int L=lb,R=m+1;
while(R-L>1){
int M=(L+R)/2;
if(frac(pref[j][M])<=frac(pref[j][m],n)+pref[j][lb]+kek)
L=M;
else
R=M;
}
frac rest(0);
if(L==lb){
rest=frac(pref[j][m],n)*frac(1,matr[j][L])+cur;
}
else{
rest=frac(pref[j][m],n)-(frac(pref[j][L])-pref[j][lb]-kek);
if(rest.a)
rest=rest*frac(1,matr[j][L]);
rest=rest+frac(L);
}
if(rest<mn)
mn=rest,mni=j;
}
cur=mn;
// cerr<<cur.a<<' '<<cur.b<<'\n';
fr.push_back(cur);
ord.push_back(mni);
used[mni]=true;
}
for(int i=0;i<n-1;++i){
cout<<fr[i].a<<' '<<fr[i].b<<'\n';
}
for(int i=0;i<n;++i)
cout<<ord[i]+1<<' ';
cout<<'\n';
return 0;
}
