16980번 - Bitaro the Brave 서브태스크다국어

문제

Bitaro the Brave faces the Devil.

Bitaro is going to attack the Devil by arranging jewels, orbs and ingots on an H times W grid and casting a spell. The square at the i-th row (1 ≤ i ≤ H) from the top and the j-th column (1 ≤ j ≤ W) from the left is denoted by (i, j).

Now, Bitaro has arranged one of these three types on each square. Bitaro is going to cast a spell, the power of which is determined by the arrangement of jewels, orbs and ingots. Specifically, the power equals to the number of quadruplets of integers (i, j, k, l) (1 ≤ i < k ≤ H, 1 ≤ j < l ≤ W) satisfying the following condition.

Condition: Bitaro has arranged a jewel on the square (i, j), an orb on the square (i, l) and an ingot on the square (k, j).

Bitaro is wondering the power of the spell.

Write a program which, given the arrangement of jewels, orbs and ingots, calculates the power of the spell Bitaro casts.

입력

Read the following data from the standard input.

H W
S1
:
SH

S_i (1 ≤ i ≤ H) is a string of length W. The item arranged on the square (i, j) (1 ≤ j ≤ W) is a jewel if the j-th character of S_i is J, an orb if it is O and an ingot if it is I.

출력

Write one line to the standard output. The output should contain the power of the spell Bitaro casts.

제한

• 2 ≤ H ≤ 3 000.
• 2 ≤ W ≤ 3 000.
• S_i is a string of length W (1 ≤ i ≤ H).
• Each character of S_i is J, O, or I (1 ≤ i ≤ H).

서브태스크

힌트