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.LinkedList;
import java.util.Scanner;


public class Main {
	
	static boolean t = true;
	
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		while(true){
			int w = sc.nextInt(), h = sc.nextInt();
			
			if(w == 0 && h == 0){
				return;
			}
			
			char[][] map = new char[h][w];
			int s_x = 0,s_y = 0;
			
			for(int i = 0; i < h; i++){
				char[] tmp = sc.next().toCharArray();
				
				for(int j = 0; j < w; j++){
					if(tmp[j] == '@'){
						tmp[j] = '.';
						s_x = j;
						s_y = i;
					}
					map[i][j] = tmp[j];
				}
			}
			
			LinkedList<Integer> list = new LinkedList<Integer>();
			list.add((s_x << 16) + s_y);
			int count = 0;
			
			while(!list.isEmpty()){
				int t = list.poll();
				int x = t >> 16;
				int y = t & 0x00ff;
				
				if(map[y][x] == '.'){
					count++;
					map[y][x] = 'x';
				}else{
					continue;
				}
				
				if(x > 0){
					list.push(((x - 1) << 16) + y);
				}
				
				if(x < (w-1)){
					list.push(((x + 1) << 16) + y);
				}
				
				if(y > 0){
					list.push((x << 16) + (y - 1));
				}
				
				if(y < (h-1)){
					list.push((x << 16) + (y + 1));
				}
			}
			
			System.out.println(count);
		}
		
	}
	
	
}