Problem: 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

Solution (in JAVA):

Solution:
import java.util.Scanner;


public class Main {
	int w,h;
	int[][] field;
	int sx,sy;
	Scanner stdin=new Scanner(System.in);
	int[] dx={-1,0,1,0};
	int[] dy={0,-1,0,1};
	int count;
	
	
	
	public void Solve(){
		w=1;
		while(true){
			
			count=0;
			w=stdin.nextInt();
			h=stdin.nextInt();
			if(w==0&&h==0)break;
			field=new int [h][w];
			
			for(int i=0;i<h;i++){
				String str=stdin.next();
				for(int j=0;j<w;j++){
					char c=str.charAt(j);
					if(c=='.') field[i][j]=1;
					if(c=='#') field[i][j]=0;
					if(c=='@'){
						field[i][j]=1;
						sx=i;
						sy=j;
					}
				}
			}
			//System.out.println(sx+"s"+sy);
			dfs(sx,sy);
			System.out.println(count);
			
			
			
		}
		
		
		
		
	}
	public void dfs(int x,int y){
		count++;
		field[x][y]=0;
		for(int i=0;i<4;i++){
			int xx=x+dx[i];
			int yy=y+dy[i];
			
			
			if(xx>=0&&xx<h&&yy>=0&&yy<w){
				if(field[xx][yy]==1){
					//System.out.println(xx+ " "+yy);
					dfs(xx,yy);
				}
			}
		}
		
	}
	
	
	
	public static void main(String args[]){
		Main m=new Main();
		m.Solve();
	}
}