Counting Connected Christmas Puddles

Description

You are given an $R \times C$ Christmas map. Each cell contains either:

• 'S' — snow, representing a snowy patch
• '.' — ground, representing regular land

Two snowy cells are considered connected if they touch up, down, left, or right (4-directional).

Your task is to determine how many separate snowy puddles exist on Santa’s map. Think of each connected group of 'S' cells as a snow puddle that Santa might step in while delivering presents!

Input Specification

• The first line contains two integers $R$ and $C$ — the number of rows and columns.
• The next $R$ lines each contain exactly $C$ characters representing the map row.

Constraints:

• $1 \le R, C \le 2000$
• The grid contains only characters 'S' and `'.'$.

Output Specification

Output a single integer — the number of connected snowy puddles on the map.

Sample Cases

Sample Input

Sample Output