#include <iostream> #include <vector> #include <algorithm> #include <string> #define ll long long using namespace std; const int MAXN = 3005; int numb1[MAXN][MAXN]; int numb2[MAXN][MAXN]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; vector<string> mat(n); for (int i = 0; i < n; i++) { cin >> mat[i]; } for (int i = 0; i < n; i++) { int now = 0; for (int j = m - 1; j >= 0; j--) { if (mat[i][j] == 'O') now++; numb1[i][j] = now; } } for (int j = 0; j < m; j++) { int now = 0; for (int i = n - 1; i >= 0; i--) { if (mat[i][j] == 'I') now++; numb2[i][j] = now; } } ll ans = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (mat[i][j] == 'J') ans += numb1[i][j] * numb2[i][j]; } //cerr << endl; } cout << ans << endl; }