Have you ever played Weiqi?
In a composition, there exist two kinds of chess pieces black and white.
The problem is so easy, can you find out how many white pieces are encircled by blacks?

First line will contain two integers M and N (3 <= M, N <= 100), means the size of the composition.
Then M lines, each line N integers only including '1', '2', and '0' ('1' represent black piece, '2' represent white piece and '0' represent empty).

Print how many white pieces are encircled by black.