#include <bits/stdc++.h>
using namespace std;
#define int long long
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
#define gg exit(0);
const int N=3010;
int m,n,ret;
int r[N][N],d[N][N];
char a[N][N];
main(){
#define task "Bitaro"
//freopen(task".inp","r",stdin);
//freopen(task".out","w",stdout);
fasty;
cin>>m>>n;
forinc(i,1,m) forinc(j,1,n) cin>>a[i][j];
forinc(i,1,m) fordec(j,n,1) r[i][j]=r[i][j+1] + (a[i][j]=='O');
fordec(i,m,1) forinc(j,1,n) d[i][j]=d[i+1][j] + (a[i][j]=='I');
forinc(i,1,m) forinc(j,1,n) if(a[i][j]=='J') ret+=r[i][j] * d[i][j];
cout<<ret;
}
