#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
constexpr ll sz=1000000,INF=1000000000000000000;
using namespace std;
void solve()
{
ll n,m,ans=0;
cin>>n>>m;
vector<vector<ll>>prefs1(n+1,vector<ll>(m+1,0)),prefs2(m+1,vector<ll>(n+1,0));
vector<vector<char>>grid(n+1,vector<char>(m+1));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>grid[i][j];
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(grid[i][j]=='O')
{
prefs1[i][j]=prefs1[i][j-1]+1;
}
else
{
prefs1[i][j]=prefs1[i][j-1];
}
}
}
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
if(grid[j][i]=='I')
{
prefs2[i][j]=prefs2[i][j-1]+1;
}
else
{
prefs2[i][j]=prefs2[i][j-1];
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(grid[i][j]=='J')
{
ans+=(prefs1[i][m]-prefs1[i][j])*(prefs2[j][n]-prefs2[j][i]);
}
}
}
cout<<ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr),cout.tie(nullptr);
ll t=1;
//cin>>t;
while(t--)
{
solve();
}
}
