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

DFS:

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
char a[21][21];
int vis[21][21];
int ax,ay,ans,n,m;
int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
void dfs(int x,int y)
{
    int i,x1,y1;
    for(i=0;i<4;i++)
    {
        x1=x+dir[i][0];
        y1=y+dir[i][1];
        if(a[x1][y1]=='.'&&vis[x1][y1]==0)
        {
            ans++;
            vis[x1][y1]=1;
            dfs(x1,y1);
        }
    }
    return;
}
int main()
{
    while(scanf("%d%d",&n,&m)&&(n+m))
    {
        getchar();
        memset(vis,0,sizeof(vis));
        memset(a,'#',sizeof(a));
        int i,j;
        for(i=1; i<=m; i++)
        {
            for(j=1; j<=n; j++)
            {
                cin>>a[i][j];
                if(a[i][j]=='@')
                {
                    ax=i;
                    ay=j;
                }
            }
        }
        ans=1;
        dfs(ax,ay);
        printf("%d\n",ans);
    }
    return 0;
}