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{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		while(true){
			int w = sc.nextInt();
			int h = sc.nextInt();
			if(w+h==0) break;
			int[][] tile = new int[h+2][w+2];
			int start_x = 0, start_y = 0;
			for(int i=1; i<=h; i++){
				String temp = sc.next();
				for(int j=1; j<=w; j++){
					if(temp.charAt(j-1)=='.'){
						tile[i][j] = 1;
					}else if(temp.charAt(j-1)=='@'){
						tile[i][j] = 1;
						start_x = j;
						start_y = i;
					}
				}
			}
			int count = Main.Count_tile(tile, start_x, start_y);
			System.out.println(count);
		}
	}

	static final int[] dx = {1, 0, -1, 0};
	static final  int[] dy = {0, 1, 0, -1};

	static int Count_tile(int[][] tile, int x, int y){
		int sum = 1;
		tile[y][x] = 0;
		for(int i=0; i<4; i++){
			if(tile[y+dy[i]][x+dx[i]]==1){
				sum += Main.Count_tile(tile, x+dx[i], y+dy[i]);
			}
		}
		return sum;
	}
}