#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define fr first
#define sc second
#define endl '\n'
using namespace std;
#define mid ((left+right)>>1)
#define int ll
int n,m;
int sum[2023];
int arr[2023][2023];
pair<int,int>ans[2023];
vector<int>v;
int gcd(int x,int y){
if(x<y)swap(x,y);
if(!y)return x;
return gcd(y,x%y);
}
signed main(){
ios_base::sync_with_stdio(23^23);cin.tie(0);
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin>>arr[i][j];
sum[i]+=arr[i][j];
arr[i][j]+=arr[i][j-1];
}
}
pair<int,int>pos={0,1};
for(int j=1;j<n;j++){
int opt=0;
pair<int,int>nex={m+1,1};
for(int i=1;i<=n;i++){
if(ans[i].fr)continue;
int bas=pos.fr/pos.sc+1;
int l=bas,r=m;
while(l<r){
int mi=(l+r)/2;
int o=arr[i][bas]-arr[i][bas-1];
int p1=pos.sc-(pos.fr%pos.sc);
int p2=pos.sc;
int x=arr[i][mi]-arr[i][bas];
if((o*p1+x*p2)*n>=sum[i]*p2)r=mi;
else l=mi+1;
}
int x=arr[i][l-1]-arr[i][bas];
int p1=pos.sc-(pos.fr%pos.sc),p2=pos.sc;
int t=arr[i][l]-arr[i][l-1],o=arr[i][bas]-arr[i][bas-1];
pair<int,int>can={sum[i]*p2-x*n*p2-o*n*p1,n*t*p2};
can.fr+=(l-1)*can.sc;
assert(min(can.fr,can.sc)>=0);
int g=gcd(can.fr,can.sc);
can.fr/=g;
can.sc/=g;
if(nex.fr*can.sc>can.fr*nex.sc){
opt=i;
nex=can;
}
}
pos=ans[opt]=nex;
v.pb(opt);
}
for(int i=1;i<=n;i++){
if(ans[i].fr==0){
ans[i]={m,1};
v.pb(i);
}
}
for(int x:v){
if(ans[x].fr==m&&ans[x].sc==1)break;
cout<<ans[x].fr<<" "<<ans[x].sc<<endl;
}
for(int x:v){
cout<<x<<" ";
}
cout<<endl;
}
