#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,x,m,i,k,tot,max1=0,ans=0,len=0;
	int a[20][20],b[20][20],s[20],ans1[20][5];
	cin>>n>>m;
	for(i=1;i<=n;i++){ 
		s[i]=1;
		for(k=1;k<=m;k++){
			ans1[i][k]=0;
		    cin>>a[i][k];
		    if(k!=1) b[i][k]=a[i][k]-a[i][k-1];
		    else b[i][k]=a[i][k];
		}
	}
	while(len<m){
	    for(i=1;i<=n;i++){
	    	if(b[i][s[i]]>max1){
	    	    max1=b[i][s[i]];
	    	    x=i;
			}
	    }
	    s[x]++;
	    ans1[len+1][1]=x;
	    ans1[x][2]++;
	    ans+=max1;
	    max1=0;
	    len++;
	} 
	cout<<ans<<"\n";
	for(i=1;i<=n;i++){
		for(k=1;k<=2;k++){
			cout<<ans1[i][k]<<" ";
		}
		cout<<endl;
	}
	return 0;
}