You stumble across a jungle rumored to have ancient treasures in it. Luckily, you have a map of the jungle with the locations of the treasure chests.

Your map contains the following legend:

From any given position, you may travel to an adjacent square as long as it is not covered by a tree.

Given the contents of the map with ~R~ rows and ~C~ columns, determine the maximum amount of treasure chests you are able to loot.

Constraints

~2 \le R, C \le 1000~

Input Specification

The first line of input contains ~2~ space-separated integers, ~R~ and ~C~.

The next ~R~ lines of input each contain ~C~ characters, representing the contents of the map.

It is guaranteed that S will appear exactly once and all other characters will be present on the legend.

Output Specification

Output a single integer, the total number of treasure chests that are reachable from your starting position.

Sample Input

3 7
S..C.X.
XX..X.C
C...X..

Sample Output

2