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.*;

public class Main {
	static int r = 0;
	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;
			r = 0;
			int x = 0;
			int y = 0;
			String fs;
			int[][] fi = new int[h][w];
			int[][] l = new int[h][w];
			for (int i = 0; i < h; i++)
				for (int j = 0; j < w; j++)
					l[i][j] = 0;
			for (int i = 0; i < h; i++) {
				fs = sc.next();
				for (int j = 0; j < w; j++) {
					if (fs.charAt(j) == '.')
						fi[i][j] = 1;
					if (fs.charAt(j) == '#')
						fi[i][j] = 0;
					if (fs.charAt(j) == '@') {
						fi[i][j] = 1;
						x = i;
						y = j;
					}
				}
			}
			loop(x, y, fi, l);
			System.out.println(r);
		}
		sc.close();
	}

	public static void loop(int x, int y, int[][] fi, int[][] l) {
		r++;
		l[x][y] = 1;
		if (x > 0)
			if (fi[x - 1][y] != 0 && l[x - 1][y] == 0)
				loop(x - 1, y, fi, l);
		if (x < h - 1)
			if (fi[x + 1][y] != 0 && l[x + 1][y] == 0)
				loop(x + 1, y, fi, l);
		if (y > 0)
			if (fi[x][y - 1] != 0 && l[x][y - 1] == 0)
				loop(x, y - 1, fi, l);
		if (y < w - 1)
			if (fi[x][y + 1] != 0 && l[x][y + 1] == 0)
				loop(x, y + 1, fi, l);
	}
}