atcoder#ABC280A. [ABC280A] Pawn on a Grid

[ABC280A] Pawn on a Grid

Score : 100100 points

Problem Statement

There is a grid with HH rows from top to bottom and WW columns from left to right. Each square has a piece placed on it or is empty.

The state of the grid is represented by HH strings S1,S2,,SHS_1, S_2, \ldots, S_H, each of length WW. If the jj-th character of SiS_i is #, the square at the ii-th row from the top and jj-th column from the left has a piece on it; if the jj-th character of SiS_i is ., the square at the ii-th row from the top and jj-th column from the left is empty.

How many squares in the grid have pieces on them?

Constraints

  • 1H,W101\leq H,W \leq 10
  • HH and WW are integers.
  • SiS_i is a string of length WW consisting of # and ..

Input

The input is given from Standard Input in the following format:

HH WW

S1S_1

S2S_2

\vdots

SHS_H

Output

Print the number of squares with pieces as an integer.

3 5
#....
.....
.##..
3

The following three squares have pieces on them:

  • the square at the 11-st row from the top and 11-st column from the left;
  • the square at the 33-rd row from the top and 22-nd column from the left;
  • the square at the 33-rd row from the top and 33-rd column from the left.

Thus, 33 should be printed.

1 10
..........
0

Since no square has a piece on it, 00 should be printed.

6 5
#.#.#
....#
..##.
####.
..#..
#####
16