#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void Solve()
{
int h, w; cin >> h >> w;
vector<string> s(h);
vector<int> rs(h, 0);
vector<int> cs(w, 0);
for (int i = 0; i < h; i++){
cin >> s[i];
for (int j = 0; j < w; j++){
if (s[i][j] == 'O') rs[i]++;
else if (s[i][j] == 'I') cs[j]++;
}
}
int ans = 0;
for (int i = 0; i < h; i++){
for (int j = 0; j < w; j++){
if (s[i][j] == 'O') rs[i]--;
else if (s[i][j] == 'I') cs[j]--;
else ans += rs[i] * cs[j];
}
}
cout << ans << "\n";
}
int32_t main()
{
auto begin = std::chrono::high_resolution_clock::now();
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin >> t;
for(int i = 1; i <= t; i++)
{
//cout << "Case #" << i << ": ";
Solve();
}
auto end = std::chrono::high_resolution_clock::now();
auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
return 0;
}
