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 {
	static char filed[][];
	static int mx[]={-1,0,1,0};
	static int my[]={0,-1,0,1};
	static int w,h,count;
	
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int i,j,x=0,y=0;
		char ch[];
		while(true){
			count=0;
			w=sc.nextInt();
			h=sc.nextInt();
			if(w+h==0) break;
			
			filed=new char[h][w];
			ch=new char[w];
			for(i=0;i<h;i++){
				ch=sc.next().toCharArray();
				for(j=0;j<w;j++){
					filed[i][j]=ch[j];
				}
			}
			for(i=0;i<h;i++){
				for(j=0;j<w;j++){
					if(filed[i][j]=='@'){
						y=i;
						x=j;
					}
				}
			}
			filed[y][x]='#';
			serch(x,y);
			System.out.println(count);
		}
	}
	static void serch(int x,int y){
		int i,nx,ny;
		count++;
		for(i=0;i<4;i++){
			nx=x+mx[i];
			ny=y+my[i];
			if(0<=nx && nx<w && 0<=ny && ny<h && filed[ny][nx]!='#'){
				filed[ny][nx]='#';
				serch(nx,ny);
			}
		}
	}
}