#include <bits/stdc++.h>
using namespace std;

int i, n, j, m, x;
long long mn = 1e18 + 69 * 69, meet[30], sum = 0;
vector<int> v[50005];
vector<vector<int>> rs;

int main() {
  ios_base::sync_with_stdio(0);

  cin >> m >> n;

  for(i = 1; i <= m; ++i)
    for(j = 0; j < n; ++j)
      cin >> x, v[i].push_back(x), meet[j] += x;

  for(i = 0; i < n; ++i) meet[i] /= m;

  for(i = 1; i <= m; ++i) {
    long long dist = 0;
    for(j = 0; j < n; ++j) dist += abs(v[i][j] - meet[j]);
    if(mn > dist) mn = dist;
  }

  for(i = 1; i <= m; ++i) {
    long long dist = 0;
    for(j = 0; j < n; ++j) dist += abs(v[i][j] - meet[j]);

    sum += dist;
    if(dist == mn) rs.push_back(v[i]);
  }

  sort(rs.begin(), rs.end());

  cout << sum << '\n';
  cout << rs.size() << '\n';
  for(auto v : rs) {
    for(auto it : v)
      cout << it << ' ';
    cout << '\n';
  }

  return 0;
}