Sheep

Mickey's backyard contains several sheep. While he was asleep, hungry wolves entered the yard and attacked them.

The yard is a rectangle made of rows and columns. A . is an empty cell, # is a fence, o is a sheep, and v is a wolf.

Two cells are in the same region if one can move from one to the other using only horizontal and vertical moves without crossing a fence. A cell from which it is possible to leave the yard is not considered part of any region. Initially, every sheep and wolf is inside a region of the yard.

In each region, the sheep can fight the wolves. If the number of sheep in that region is greater than the number of wolves, the sheep win and drive out all wolves in that region. Otherwise, the wolves eat all sheep in that region.

Write a program that prints how many sheep and wolves are still alive in the morning.

The first line contains two integers R and C (3 <= R, C <= 250), the number of rows and columns in the yard.

Each of the next R lines contains exactly C characters describing the yard: fences, sheep, wolves, and empty cells.

Print two integers on one line: the number of sheep and wolves that survive until morning.