#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define vl vector<long long>
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
int arr[3001][3001];
ll down[3001][3001];
ll right_[3001][3001];
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random();
int n,m;
cin >> n >> m;
rep(i,n)
{
string s;
cin >> s;
rep(j,m)
{
if(s[j] == 'J') arr[i][j] = 0;
if(s[j] == 'O') arr[i][j] = 1;
if(s[j] == 'I') arr[i][j] = 2;
}
}
for(int i = n-1; i >= 0; i--)
{
for(int j = m-1; j >= 0; j--)
{
down[i][j] = down[i+1][j] + (arr[i][j] == 2? 1 : 0);
right_[i][j] = right_[i][j+1] + (arr[i][j] == 1 ? 1 : 0);
}
}
ll ans = 0;
rep(i,n)
{
rep(j,m)
{
if(arr[i][j] == 0) ans += down[i][j] * right_[i][j];
}
}
cout << ans << "\n";
}
