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 {
	
	Scanner sc = new Scanner(System.in);
	public void run() {
		while(sc.hasNext()){
			int w = sc.nextInt();
			int h = sc.nextInt();
			sc.nextLine();
			if(w == 0 && h == 0) break;
			else calc(w,h);
		}
	}

	public void calc(int w, int h){
		int[][] tile = new int[w][h];
		int nowX = 0;
		int nowY = 0;
		for(int j = 0; j < h; j++){
			String line = sc.nextLine();
			for(int i = 0; i < w; i++){
				char c = line.charAt(i);
				if(c == '.') tile[i][j] = 1;
				else if(c == '@'){
					tile[i][j] = 1;
					nowX = i;
					nowY = j;
				}
			}
		}
		System.out.println(calc2(tile, tile, nowX, nowY));
	}
	public int calc2(int[][] tile, int[][] tile2, int X, int Y){
		tile2[X][Y] = 0;
 		int ue = 0;
		if(Y > 0 && tile[X][Y-1] == 1 && tile2[X][Y-1] != 0) 
			ue = calc2(tile, tile2, X, Y-1);
		int shita = 0;
		if(Y < tile[X].length - 1 && tile[X][Y+1] == 1 && tile2[X][Y+1] != 0) 
			shita = calc2(tile, tile2, X, Y+1);
		int hidari = 0;
		if(X > 0 && tile[X-1][Y] == 1 && tile2[X-1][Y] != 0)
			hidari = calc2(tile, tile2, X-1, Y);
		int migi = 0;
		if(X < tile.length - 1 && tile[X+1][Y] == 1 && tile2[X+1][Y] != 0)
			migi = calc2(tile, tile2, X+1, Y);
		
		return ue + shita + migi + hidari + 1;
	}
	public static void main(String[] args) {
		new Main().run();
	}
}