F - Red and Black

Description

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>
int m,n,cnt;
int to[4][2]={{0,-1},{0,1},{1,0},{-1,0}};
char a[25][25];
void dps(int i,int j)
{
	cnt++;
	a[i][j]='#';
	for(int k=0;k<4;k++)
	{
	   int x=i+to[k][0];
	   int y=j+to[k][1];
	   if(x>=0 && x<n && y>=0 && y<m &&a[x][y]=='.')
	     dps(x,y); 
	}
}
int main()
{
	while(~scanf("%d%d",&m,&n),m||n)
	{
		cnt=0;
		int fi,fj;
		getchar();
		for(int i=0;i<n;i++)
		{
		   for(int j=0;j<m;j++)
		   {
		  	 scanf("%c",&a[i][j]);
		  	 if(a[i][j]=='@')
		  	 {
		  	 	fi=i;
		  	 	fj=j;
		  	 }
 		   } 
		   getchar();
		}
 		dps(fi,fj);
		printf("%d\n",cnt);    
	}
	
}