using namespace std;
#include<fstream>
const int MAX_N = 1003;
int A[MAX_N][MAX_N], N, M;
int lg[MAX_N][MAX_N];
int main()
{
	ifstream in("dreptpal.in"); ofstream out("dreptpal.out");
	in >> N >> M;
	int i, j, k;
	for(i = 1; i <= N; ++i )
		for(j = 1; j <= M; ++j )
			in >> A[i][j];
	for(i = 1; i <= N; ++i)
		for(j = 1; j <= M; ++j )
		{
			lg[i][j] = 1;
			k = 1;
			while( j + k <= M && j - k > 0 && A[i][j-k] == A[i][j+k] ) lg[i][j] += 2;
		}
	out << N * M;
	return 0;
}