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 boolean[][] map;
	
	Main(boolean[][] map) {
		this.map = map;
	}
		
	int solve(int y, int x) {
		if (y < 0 || x < 0 || y >= h || x >= w || !map[y][x]) return 0;
		map[y][x] = false;
		return solve(y + 1, x) + solve(y - 1, x) + solve(y, x + 1) + solve(y, x - 1) + 1;
	}
	
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		while(true) {
			w = scan.nextInt();
			h = scan.nextInt();
			if (w == 0 && h == 0) break;
			boolean[][] room = new boolean[h][];
			int y = 0;
			int x = 0;
			scan.nextLine();
			for (int i = 0; i < h; i++)
				room[i] = new boolean[w];
			for (int i = 0; i < h; i++) {
				String str = scan.nextLine();
				for (int j = 0; j < w; j++) {
					switch (str.charAt(j)) {
						case '.': room[i][j] = true; break;
						case '#': room[i][j] = false; break;
						case '@':
							room[i][j] = true;
							y = i;
							x = j;
							break;
					}
				}
			}
			System.out.println(new Main(room).solve(y, x));
		}
	}
}