#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
void solve(){
int n, m; cin >> n >> m;
string s[n + 1]; for (int i = 1; i <= n; i++) cin >> s[i], s[i] = ' ' + s[i];
int orb[n + 2][m + 2], ingot[n + 2][m + 2];
for (int i = 1; i <= n; i++) {
orb[i][m + 1] = 0;
for (int j = m; j >= 1; j--) orb[i][j] = orb[i][j + 1] + (s[i][j] == 'O');
}
for (int i = 1; i <= m; i++) {
ingot[n + 1][i] = 0;
for (int j = n; j >= 1; j--) ingot[j][i] = ingot[j + 1][i] + (s[j][i] == 'I');
}
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (s[i][j] == 'J') ans += orb[i][j + 1] * ingot[i + 1][j];
}
}
cout << ans;
}
int32_t main(){
iShowSpeed;
// int q; cin >> q; while (q--)
solve();
}
