Red and Black

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).

Sample Input

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

Sample Output

45
59
6
13

代码：

#include<stdio.h>
#include<string.h>
int next[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
char a[30][30];
int book[30][30];
int i,j,w,h,x,y,s;
void dfs(int x,int y);
int main()
{
    while(scanf("%d%d",&w,&h)!=EOF)
    {
		memset(a,0,sizeof(a));
        memset(book,0,sizeof(book));
        s=1;
        for(i=0;i<h;i++)
			scanf("%s",a[i]);
		if(w==0&&h==0)
			break;
        for(i=0;i<h;i++)
			for(j=0;j<w;j++)
				if(a[i][j]=='@')
				{
					x=i;y=j;
				}
		dfs(x,y);
        printf("%d\n",s);
    }
}
void dfs(int x,int y)
{
    int k,tx,ty;
    for(k=0;k<4;k++)
    {
      	tx=x+next[k][0];
      	ty=y+next[k][1];
    	if(tx>=0&&tx<h&&ty>=0&&ty<w&&book[tx][ty]==0&&a[tx][ty]=='.')
       	{
        	s++;
           	book[tx][ty]=1;
           	dfs(tx,ty);
       	}
    }
}