#include <bits/stdc++.h>

using namespace std;
long long sum[26];
int n,m,total,mini=9999999,nr=0;
struct fr
{
    int val[26];
    int dist;
    bool operator()(fr a,fr b)
    {
        for(int k=1;k<=n;k++) if(a.val[k]!=b.val[k]) return a.val[k]<b.val[k];

        return 1;
    }
}v[50001];



int main()
{
    //freopen("data.in","r",stdin);
    cin>>m>>n;
    for(int i=1; i<=m; i++)
        for(int j=1; j<=n; j++) cin>>v[i].val[j],sum[j]+=v[i].val[j];

    for(int j=1; j<=n; j++) sum[j]/=n;

    for(int i=1; i<=m; i++)
    {
        for(int j=1; j<=n; j++) v[i].dist+=fabs(sum[j]-v[i].val[j]);

        if(v[i].dist<mini) mini=v[i].dist,nr=1;
        else if(v[i].dist==mini) nr++;
    }

    for(int i=1; i<=m; i++) total+=v[i].dist;
    cout<<total<<'\n';
    cout<<nr<<'\n';
    sort(v+1,v+1+n,fr());
    for(int i=1; i<=m; i++) if(v[i].dist==mini) {for(int j=1; j<=n; j++) cout<<v[i].val[j]<<' ';cout<<'\n';}

}