#include<stdio.h>

char map[32][32];
int ans;
int W,H;

void func(int x,int y){
	map[x][y] = '0';
	ans++;
	if(map[x][y+1] == '.' && y+1<32)
		func(x,y+1);
	if(map[x][y-1] == '.' && y-1>-1)
		func(x,y-1);
	if(map[x+1][y] == '.' && x+1<32)
		func(x+1,y);
	if(map[x-1][y] == '.' && x-1>-1)
		func(x-1,y);
}


int main(void){
	while(scanf("%d%d",&W, &H) && H){
		for(int i = 0; i < H; i++){
			scanf("%s",map[i]);
		}
		for(int i = 0; i < H; i++){
			for(int j = 0; j < W; j++){
				if(map[i][j] == '@'){
					func(i,j);
				}
			}
		}
		printf("%d\n",ans);
		ans=0;
		for(int i = 0; i < 32; i++){
			for(int j = 0; j < 32; j++){
				map[i][j] = 0;
			}
		}
	}
	return 0;
}
### Prompt

Construct a CPP code solution to the problem outlined:

There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can move only on black tiles.

Write a program to count the number of black tiles which he can reach by repeating the moves described above.



Input

The input consists of multiple data sets. A data set starts with a line containing two positive integers W and H; W and H are the numbers of tiles in the x- and y- directions, respectively. W and H are not more than 20.

There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.

* '.' - a black tile
* '#' - a red tile
* '@' - a man on a black tile(appears exactly once in a data set)


The end of the input is indicated by a line consisting of two zeros.

Output

For each data set, your program should output a line which contains the number of tiles he can reach from the initial tile (including itself).

Examples

Input

6 9
....#.
.....#
......
......
......
......
......
#@...#
.#..#.
11 9
.#.........
.#.#######.
.#.#.....#.
.#.#.###.#.
.#.#..@#.#.
.#.#####.#.
.#.......#.
.#########.
...........
11 6
..#..#..#..
..#..#..#..
..#..#..###
..#..#..#@.
..#..#..#..
..#..#..#..
7 7
..#.#..
..#.#..
###.###
...@...
###.###
..#.#..
..#.#..
0 0


Output

45
59
6
13


Input

6 9
....#.
.....#
......
......
......
......
......
@...#
.#..#.
11 9
.#.........
.#.#######.
.#.#.....#.
.#.#.###.#.
.#.#..@#.#.
.#.#####.#.
.#.......#.
.#########.
...........
11 6
..#..#..#..
..#..#..#..
..#..#..###
..#..#..#@.
..#..#..#..
..#..#..#..
7 7
..#.#..
..#.#..
.###
...@...
.###
..#.#..
..#.#..
0 0


Output

45
59
6
13

### Response

```cpp
#include<stdio.h>

char map[32][32];
int ans;
int W,H;

void func(int x,int y){
	map[x][y] = '0';
	ans++;
	if(map[x][y+1] == '.' && y+1<32)
		func(x,y+1);
	if(map[x][y-1] == '.' && y-1>-1)
		func(x,y-1);
	if(map[x+1][y] == '.' && x+1<32)
		func(x+1,y);
	if(map[x-1][y] == '.' && x-1>-1)
		func(x-1,y);
}


int main(void){
	while(scanf("%d%d",&W, &H) && H){
		for(int i = 0; i < H; i++){
			scanf("%s",map[i]);
		}
		for(int i = 0; i < H; i++){
			for(int j = 0; j < W; j++){
				if(map[i][j] == '@'){
					func(i,j);
				}
			}
		}
		printf("%d\n",ans);
		ans=0;
		for(int i = 0; i < 32; i++){
			for(int j = 0; j < 32; j++){
				map[i][j] = 0;
			}
		}
	}
	return 0;
}
```