#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 3010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
#define int long long
#define inf 1000000000
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1)
#define offbit(i,j) (i^(1<<j))
#define onbit(i,j) (i|(1<<j))
#define vi vector<int>
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}
using namespace std;
int n,m;
char a[N][N];
int ans;
int row1[N][N],row2[N][N],row3[N][N];
int col1[N][N],col2[N][N],col3[N][N];
main()
{
#define name "TASK"
if(fopen(name".inp","r"))
{
freopen(name".inp","r",stdin);
freopen(name".out","w",stdout);
}
ios_base::sync_with_stdio(false);cin.tie(NULL);
cin >> n >> m;
fo(i,1,n) fo(j,1,m)
{
cin >> a[i][j];
row1[i][j] = row1[i][j - 1];
row2[i][j] = row2[i][j - 1];
row3[i][j] = row3[i][j - 1];
if(a[i][j] == 'J') row1[i][j]++;
if(a[i][j] == 'O') row2[i][j]++;
if(a[i][j] == 'I') row3[i][j]++;
}
fo(j,1,m)
{
fo(i,1,n)
{
col1[i][j] = col1[i - 1][j];
col2[i][j] = col2[i - 1][j];
col3[i][j] = col3[i - 1][j];
if(a[i][j] == 'J') col1[i][j]++;
if(a[i][j] == 'O') col2[i][j]++;
if(a[i][j] == 'I') col3[i][j]++;
}
}
fo(i,1,n) fo(j,1,m)
{
if(a[i][j] == 'J')
{
// cout << i << ' ' << j << "\n";
ans += (row2[i][m] - row2[i][j - 1]) * (col3[n][j] - col3[i - 1][j]);
}
}
cout << ans;
}
