#include "bits/stdc++.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
using ll = long long;
const int mod = 1e9+7;
void solve(int tc) {
int n, m;
cin >> n >> m;
vector<vector<char>> v(n, vector<char>(m));
vector<vector<int>> ing(n, vector<int>(m)), orb(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> v[i][j];
ing[i][j] = (v[i][j] == 'I');
if (i) ing[i][j] += ing[i-1][j];
orb[i][j] = (v[i][j] == 'O');
if (j) orb[i][j] += orb[i][j-1];
}
}
ll ans = 0;
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
ans += (v[i][j] == 'J') * (ing[n-1][j] - ing[i][j]) * (orb[i][m-1] - orb[i][j]);
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int tc = 1;
//cin >> tc;
for (int i = 1; i <= tc; ++i) solve(i);
return 0;
}
