//#pragma GCC optomize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse4.1,sse4.2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define max_heap priority_queue<pair <ll, pair <ll, ll>>>
#define min_heap priority_queue<pair <ll, ll>, vector<pair <ll, ll>>, greater<pair <ll, ll>>>
//#define min_heap priority_queue<ll, vector<ll>, greater<ll>>
#define sariE cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
#define filE freopen("in.txt", "r", stdin); freopen("out1.txt", "w", stdout);
#define endl '\n'
#define md(a) (a % mod + mod) % mod
#define pb push_back
//cout << vectorprecision(5) << fixed << f;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll const maxn = 2e5 + 123;
ll const inf = 2e18;
ll const loG = 23;
//ll const mod = 1e9 + 7;
ll const mod = 998244353;
ll const sq = 350;
ll power(ll a, ll b, ll mod){if(b==0)return 1;if(b==1)return a;ll x = power(a, b / 2, mod);return (((x * x) % mod) * (b % 2 ? a : 1)) % mod;}
ll n, m, satr[3030][3030], soton[3030][3030];
string mp[3030];
void Solve(){
cin >> n >> m;
for (int i = 1; i < n + 1; i++){
cin >> mp[i];
mp[i] = ' ' + mp[i];
}
for (int i = 1; i < n + 1; i++){
for (int j = 1; j < m + 1; j++){
satr[i][j] = satr[i][j - 1];
if (mp[i][j] == 'O')
satr[i][j]++;
}
}
for (int j = 1; j < m + 1; j++){
for (int i = 1; i < n + 1; i++){
soton[j][i] = soton[j][i - 1];
if (mp[i][j] == 'I')
soton[j][i]++;
}
}
ll ans = 0;
for (int i = 1; i < n + 1; i++){
for (int j = 1; j < m + 1; j++){
if (mp[i][j] == 'J'){
ll x = satr[i][m] - satr[i][j];
ll y = soton[j][n] - soton[j][i];
ans += x * y;
}
}
}
cout << ans << endl;
}
int main(){
sariE;// filE;
int test = 1;
//cin >> test;
while (test--) Solve();
return 0;
}
