#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;
typedef pair<int,int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0};
int32_t main(){
boost;
int R,C; cin>>R>>C;
char g[R][C];
int a[R][C], b[R][C];
for(int i=0; i<R; i++) for(int j=0; j<C; j++){
cin>>g[i][j];
a[i][j]=b[i][j]=0;
}
for(int i=0; i<R; i++){
if(g[i][C-1]=='O') a[i][C-1]=1;
for(int j=C-2; j>=0; j--){
a[i][j]+=a[i][j+1];
if(g[i][j]=='O') a[i][j]++;
}
}
for(int j=0; j<C; j++){
if(g[R-1][j]=='I') b[R-1][j]=1;
for(int i=R-2; i>=0; i--){
b[i][j]+=b[i+1][j];
if(g[i][j]=='I') b[i][j]++;
}
}
int ans=0;
for(int i=0; i<R; i++)for(int j=0; j<C; j++) if(g[i][j]=='J') ans+=a[i][j]*b[i][j];
cout << ans << endl;
return 0;
}
