#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;
typedef long long ll;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class A> ostream& operator<<(ostream &cout, vector<A> const &v) {cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";};
template<class A, class B> ostream& operator<<(ostream &cout, const pair<A,B> &x) {return cout << "(" <<x.first << ", " << x.second << ")";};
template<class T> void pv(T a, T b) {cerr << "["; for (T i = a; i != b; ++i) cerr << *i << " "; cerr << "]\n";}
void _print() {cerr << "]\n";}
template<class T, class... V> void _print(T t, V... v) {cerr << t; if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = [", _print(x)
#define fi first
#define se second
#define SZ(x) (int)((x).size())
#define pii pair<int,int>
string grid[3005];
int o[3005][3005], i[3005][3005];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin >> n >> m;
for (int q = 0; q < n; q++) cin >> grid[q];
for (int q = 0; q < m; q++) {
for (int w = n-1; w >= 0; w--) {
i[w][q] = i[w+1][q]+(grid[w][q] == 'I');
}
}
for (int q = 0; q < n; q++) {
for (int w = m-1; w >= 0; w--) {
o[q][w] = o[q][w+1]+(grid[q][w] == 'O');
}
}
ll ans = 0;
for (int q = 0; q < n; q++) {
for (int w = 0; w < m; w++) {
if (grid[q][w] == 'J') {
ans += 1LL*i[q][w]*o[q][w];
}
}
}
cout << ans << '\n';
return 0;
}
