#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
#define ppb pop_back
#define meta int tm = (tl + tr) / 2, x = i * 2 + 1, y = x + 1
const int SN = 3007;
const int TN = 4 * SN;
const int oo = 1e18;
const int mod = 1e9 + 7;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
int n, m, ans;
char a[SN][SN];
vi x[SN], y[SN];
int solve1(int i, int j) {
return x[i].end() - upper_bound(x[i].begin(), x[i].end(), j);
}
int solve2(int i, int j) {
return y[j].end() - upper_bound(y[j].begin(), y[j].end(), i);
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
if (a[i][j] == 'O') x[i].pb(j);
if (a[i][j] == 'I') y[j].pb(i);
}
}
for (int i = 1; i <= n; i++) {
sort (x[i].begin(), x[i].end());
}
for (int i = 1; i <= m; i++) {
sort (y[i].begin(), y[i].end());
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (a[i][j] == 'J') {
int s1 = solve1(i, j);
int s2 = solve2(i, j);
ans += s1 * s2;
}
}
}
cout << ans;
return 0;
}
