#include<bits/stdc++.h>
using namespace std;
const int N = 200005;
const int M = 5;
int m, n;
long long a[M][N], f[M][N], ans;
int main(){
  //freopen("sort.in","r",stdin);
  //freopen("sort.out","w",stdout);
  cin >> m >> n;
  for(int i = 1;i <= m;i++){
    for(int j = 1;j <= n;j++){
      cin >> a[i][j];
    }
  }
  for(int i = 1;i <= n;i++){
    for(int j = 1;j <= n;j++){
      long long Maxi = LONG_LONG_MIN, Mini = LONG_LONG_MAX;
      for(int k = 1;k <= m;k++){
        Maxi = max(Maxi, a[k][i] + a[k][j]);
        Mini = min(Mini, a[k][i] + a[k][j]);
      }
      ans += Maxi + Mini;
    }
  }
  cout << ans << endl;
  return 0;
}