#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e9+7;
const int inf = 1e18;
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
int n , m , k , q;
// map<pair<int,int>,int>ob;
void solve(int testcase_number){
cin>>n>>m;
input(string,l,n);
// set<vector<int>>ans;
vector<vector<int>>cnt0(n+1,vector<int>(m+1,0));
vector<vector<int>>cnt1(m+1,vector<int>(n+1,0));
for(int i = 0;i<n;i++){
cnt0[i][m] = 0;
for(int j = m-1;j>=0;j--){
cnt0[i][j] = cnt0[i][j+1]+(l[i][j] == 'O');
}
}
for(int i = 0;i<m;i++){
for(int j = n-1;j>=0;j--){
cnt1[j][i] = cnt1[j+1][i]+(l[j][i] == 'I');
// cout<<cnt1[j][i]<<" ";
}
// cout<<endl;
}
// cout<<endl;
int ans = 0;
for(int i = 0;i<n;i++){
for(int j = 0;j<m;j++){
if(l[i][j] == 'J'){
int ank =cnt0[i][j+1];
int ant =cnt1[i+1][j];
// print(cnt1[i+1]);
// cout<<i+1<<" "<<j<<" "<<ant<<endl;
ans+=ant*ank;
}
}
// cout<<endl;
}
cout<<ans<<endl;
}
signed main(){
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);
cout << fixed<<setprecision(9);
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++){
solve(i);
}
}
