#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
/*
Phu Trong from Nguyen Tat Thanh High School for gifted student
*/
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
#define MAX 3333
char A[MAX][MAX];
int I[MAX][MAX], O[MAX][MAX];
int numRow, numCol;
void process(void){
cin >> numRow >> numCol;
FOR(i, 1, numRow) FOR(j, 1, numCol){
cin >> A[i][j];
}
FOR(i, 1, numRow) FORD(j, 1, numCol){
I[i][j] = I[i][j + 1] + (A[i][j] == 'O');
}
FORD(i, 1, numRow) FOR(j, 1, numCol){
O[i][j] = O[i + 1][j] + (A[i][j] == 'I');
}
int ans = 0;
for (int i = 1; i <= numRow; ++i){
for (int j = 1; j <= numCol; ++j){
if (A[i][j] == 'J'){
ans += O[i][j] * I[i][j];
}
}
}
cout << ans;
}
signed main(){
#define name "Whisper"
cin.tie(nullptr) -> sync_with_stdio(false);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
process();
return (0 ^ 0);
}
