#include<iostream>
#include<algorithm>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<string> vec(n);
for(int i = 0; i < n; i++) cin >> vec[i];
ll ans = 0;
vector<vector<ll>> co(n + 1, vector<ll>(m + 1)), ci(n + 1, vector<ll>(m + 1));
for(int i = n - 1; i >= 0; i--){
for(int j = m - 1; j >= 0; j--){
co[i][j] = co[i][j + 1];
if(vec[i][j] == 'O') co[i][j]++;
ci[i][j] = ci[i + 1][j];
if(vec[i][j] == 'I') ci[i][j]++;
if(vec[i][j] == 'J') ans += co[i][j] * ci[i][j];
}
}
cout << ans << "\n";
}
// g++ -std=c++17 -Wall -Wextra -Wshadow -fsanitize=undefined -fsanitize=address -o run pA.cpp
