#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
/*---------------------DEBUGGING--------------------------------------------*/
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
/*-------------------------------------------------------------------------------------*/
//#define mp make_pair
#define pb push_back
#define ll long long
#define pii pair<int,int>
#define pcc pair<char,char>
#define F first
#define S second
#define int long long
#define pi 3.141592653589793238462643383279502
#define M  998244353//1000000007
#define rep(i,a,n) for(int i=a;i<n;i++)
#define INF 1000000000000000
#define N 500005
#define vi vector<int>
#define all(v) v.begin(),v.end()
#define endl "\n"
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
void solve()
{
    int n,m;
    cin>>n>>m;
    int a[n][m];
    int sum=0,mn=INF;
    rep(i,0,n)
    {
        rep(j,0,m)
        {
            cin>>a[i][j];
            mn=min(mn,a[i][j]);
            sum+=a[i][j];
        }
    }
    cout<<(sum - (n*m*mn))<<endl;
}
signed main()
{
   ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
   int tests;
   //cin>>tests;
   tests=1;
   for(int i=0;i<tests;i++)
   {
       solve();
   }
}

#include <bits/stdc++.h>
using namespace std;
//const int mod = (int)1e9+7; 
#define int long long
signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int h, w;
    cin >> h >> w;
  //  vecto<vector<int>>arr(h, vector<int>(w));
    int total = 0;
    int m = 200;
    for (int i = 0; i < h; i++){
    	for (int j = 0; j < w; j++){
    		int x;
    		cin >> x;
    		total += x;
    		m = min(m, x);
    	}
    }
    cout << total - (m*h*w) << "\n";
    return 0;
}
