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

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<iostream>
#include<algorithm>
#include<string.h>
#include<queue>
using namespace std;
int m,n;
char str[30][30];
int dis[4][2]={1,0,-1,0,0,1,0,-1};
int vis[30][30];
struct node{
    int x,y;
};
/*bool operator <(const node &a,const node &b)
{
    return 
}*/
void BFS( int x,int y){
    node e1,e2;
    queue<node >que;
    e1.x=x;e1.y=y;
    que.push(e1);
    memset(vis,0,sizeof(vis));
    vis[x][y]=1;
    int ans=1;    
    while(!que.empty()){
        e1=que.front();                     
        que.pop();
        for(int i=0;i<4;i++){
            e2.x=e1.x+dis[i][0];
            e2.y=e1.y+dis[i][1];
            if(e2.x<0||e2.y<0||e2.x>=n||e2.y>=m||vis[e2.x][e2.y]||str[e2.x][e2.y]=='#')  continue;
            else
            {
                que.push(e2);
                ans++;
                vis[e2.x][e2.y]=1;
            }
        }
    }
    cout<<ans<<endl;
}
int main()
{
    while(scanf("%d%d",&m,&n)!=EOF&&(m||n)){
        for(int i=0;i<n;i++){
            scanf("%s",str[i]);
        }
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                if(str[i][j]=='@'){
                    BFS(i,j);
                    break;
                }
            }
        }
    }
    return 0;
}

//DFS