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 int w;
	static int h;
	
	public static void main(String[] args){
		
		Scanner sc = new Scanner(System.in);
		
		
		while(true){
			
			w = sc.nextInt();
			h = sc.nextInt();
			if(w == 0 && h == 0){
				break;
			}
			sc.nextLine();
			int[][] map = new int[w][h];
			String line;
			int x = 0;
			int y = 0;
			
			for(int i = 0; i < h; i++){
				line = sc.nextLine();
				for(int j = 0; j < w ; j++){
					if(line.charAt(j) == '.'){
						map[j][i] = 1;
					}else if(line.charAt(j) == '#'){
						map[j][i] = 0;
					}else if(line.charAt(j) == '@'){
						map[j][i] = 2;
						x = j;
						y = i;
					}
				}
			}
			
			map = Sosaku(x , y, map);
			
			int sum = 0;
			for(int i = 0; i < h; i++){
				for(int j = 0; j < w; j++){
					if(map[j][i] == 2){
						sum++;
					}
				}
			}
			
			System.out.println(sum);
		}
		
	}

	private static int[][] Sosaku(int x, int y, int[][] map) {
		if(x < w - 1 && map[x + 1][y] == 1){
			map[x + 1][y] = 2;
			map = Sosaku(x + 1, y, map);
		}
		if(x > 0 && map[x -1][y] == 1){
			map[x - 1][y] = 2;
			map = Sosaku(x - 1, y, map);
		}
		if(y < h - 1 && map[x][y + 1] == 1){
			map[x][y + 1] = 2;
			map = Sosaku(x, y + 1, map);
		}
		if(y > 0 && map[x][y - 1] == 1){
			map[x][y - 1] = 2;
			map = Sosaku(x, y - 1, map);
		}
		return map;
	}

}