#include <bits/stdc++.h>
#define FOR(i,x,n) for(int i=x; i<n; i++)
#define F0R(i,n) FOR(i,0,n)
#define ROF(i,x,n) for(int i=n-1; i>=x; i--)
#define R0F(i,n) ROF(i,0,n)
#define WTF cout << "WTF" << endl
#define IOS ios::sync_with_stdio(false); cin.tie(0)
#define F first
#define S second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
const int N = 3000 + 7;
const int ALPHA = 27;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;
int n, m;
LL ups[N][N], rps[N][N];
char grid[N][N];
int main() {
IOS;
cin >> n >> m;
F0R(i, n) F0R(j, m) cin >> grid[i][j];
F0R(i, n) {
rps[i][m - 1] = (grid[i][m - 1] == 'O');
R0F(j, m - 1) rps[i][j] = rps[i][j + 1] + (grid[i][j] == 'O');
}
F0R(j, m) {
ups[n - 1][j] = (grid[n - 1][j] == 'I');
R0F(i, n - 1) ups[i][j] = ups[i + 1][j] + (grid[i][j] == 'I');
}
LL ans = 0;
F0R(i, n) F0R(j, m) if (grid[i][j] == 'J') ans += ups[i][j] * rps[i][j];
cout << ans;
}
