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.*;

public class Main{
	public static void search(int x,int y,int w,int h,String[][] map,Boolean[][] memo){
		if(x < 0 || x > w-1 || y < 0 || y > h-1 || map[x][y].equals("#")) return;
		if(memo[x][y]) return;
		memo[x][y] = true; 
		//System.out.println(x+","+y+"true");
		search(x+1,y,w,h,map,memo);
		search(x,y-1,w,h,map,memo);
		search(x-1,y,w,h,map,memo);
		search(x,y+1,w,h,map,memo);
	} 
	
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
		while(true){
			int w = scan.nextInt();
			int h = scan.nextInt();
			int count = 0;
			if(w == 0 && h == 0) break;
			String[][] map = new String[w][h];
			Boolean[][] memo = new Boolean[w][h];
			for(int i=0;i<h;i++){
				String str = scan.next(); 
				for(int j=0;j<w;j++){
					memo[j][i] = false;
					map[j][i] = String.valueOf(str.charAt(j));
				}
			}
			for(int i=0;i<h;i++){
				for(int j=0;j<w;j++){
					if(map[j][i].equals("@")){
						search(j,i,w,h,map,memo);
						break;
					}
				}
			}
			for(int i=0;i<h;i++){
				for(int j=0;j<w;j++){
					//System.out.print(map[j][i]);
					//System.out.println();
					if(memo[j][i] == true) count++;
				}
				//System.out.println("");
			}
			System.out.println(count);
			/*
			for(int i=0;i<h;i++){
				for(int j=0;j<w;j++){
					System.out.print(memo[i][j]);
				}
				System.out.println("");
			}
			*/
		}
	}
}