#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl '\n'

int t;
//int g[1005][1005];
//int r[1005][1005]; //cnt
//int c[1005][1005]; //cnt
//int precntr[1005][1005];
//int precntc[1005][1005];
//int prer[1005][1005];
//int prec[1005][1005];

void solve(){
	int n, m;
	cin >> n >> m;
	vector<vector<int>> g(n + 10, vector<int>(m + 10));
	vector<vector<int>> r(n + 10, vector<int>(m + 10));
	vector<vector<int>> c(n + 10, vector<int>(m + 10));
	
	
	map<int, int> mp;
	int cnt = 0;
	for(int i = 1; i <= n; i ++){
		for(int j = 1; j <= m; j ++){
			cin >> g[i][j];
			if(!mp[g[i][j]]) mp[g[i][j]] = 1;
		}
	}
	for(auto [x, y] : mp){
		mp[x] = ++cnt;
	}
	
	vector<vector<int>> precntr(n + 10, vector<int>(cnt + 10));
	vector<vector<int>> precntc(n + 10, vector<int>(cnt + 10));
	vector<vector<int>> prer(n + 10, vector<int>(cnt + 10));
	vector<vector<int>> prec(n + 10, vector<int>(cnt + 10));
	
	for(int i = 1; i <= n; i ++){
		for(int j = 1; j <= m; j ++){
			r[i][mp[g[i][j]]] ++;
			c[j][mp[g[i][j]]] ++;
		}
	}
	
	for(auto [x, y] : mp){
		for(int i = 1; i <= n; i ++){
			precntr[i][y] = precntr[i - 1][y] + r[i][y];
			prer[i][y] = prer[i - 1][y] + r[i][y] * i; 
		}
		for(int i = 1; i <= m; i ++){
			precntc[i][y] = precntc[i - 1][y] + c[i][y];
			prec[i][y] = prec[i - 1][y] + c[i][y] * i; 
		}
	}
	
	int ans = 0ll;
	for(int i = 1; i <= n; i ++)
		for(int j = 1; j <= m; j ++)
		{
			ans += (precntr[i-1][mp[g[i][j]]] * i - prer[i-1][mp[g[i][j]]]) * 2;
			ans += (precntc[j-1][mp[g[i][j]]] * j - prec[j-1][mp[g[i][j]]]) * 2;
		}
	cout << ans << endl;
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	t=1;
	//cin>>t;
	while(t--)solve();
	return 0;
}