#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ifstream in("input.txt");
ofstream out("output.txt");
typedef long long ll;
int h,w;
char tab[5000][5000];
ll prefb[5000][5000];
ll fb[5000];
ll f[5000];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>h>>w;
ll sumf;
ll tot=0;
for(int i=0;i<h;i++){
ll sum=0;
for(int y=0;y<w;y++){
cin>>tab[i][y];
if(i!=0&&tab[i-1][y]=='J')fb[y]+=sumf-prefb[i-1][y];
if(tab[i][y]=='O')sum++;
else if(tab[i][y]=='I'){
f[y]++;
}
else{
tot+=f[y]*fb[y];
f[y]=0;
}
if(tab[i][y]!='J'&&i==h-1){
tot+=f[y]*fb[y];
}
prefb[i][y]=sum;
}
sumf=sum;
}
printf("%lld",tot);
}
