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 scan = new Scanner(System.in);

		while (true) {
			int w = 1;
			int h = 1;
			int moveCan = 0;

			w = scan.nextInt();
			h = scan.nextInt();

			if (w == 0 && h == 0)
				break;

			char[][] table = new char[h][w];
			// int[][] num = new int[h][w];

			for (int i = 0; i < h; i++) {
				// for (int j = 0; j < w; j++) {
				table[i]/* [j] */= scan.next().toCharArray();
				// }
			}

			moveCan = AtCheck(table, w, h);
			System.out.println(moveCan);
		}

		scan.close();
	}

	public static int AtCheck(char table[][], int w, int h) {
		int befAtNum = 0;
		int aftAtNum = 0;

		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				if (table[i][j] == '@')
					befAtNum++;
			}
		}

		int[][] atPlace = new int[h][w];
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				if (table[i][j] == '@') {
					atPlace[i][j] = 1;
					// if (i != (h - 1) && j != (w - 1) && i != 0 && j != 0
					// && table[i - 1][j - 1]=='.')
					// atPlace[i - 1][j - 1] = 1;
					if (j != 0 && table[i][j - 1] == '.')
						atPlace[i][j - 1] = 1;
					// if (i != (h - 1) && j != (w - 1) && i != 0 && j != 0
					// && table[i + 1][j - 1]=='.')
					// atPlace[i + 1][j - 1] = 1;
					if (i != 0 && table[i - 1][j] == '.')
						atPlace[i - 1][j] = 1;
					if (i != (h - 1) && table[i + 1][j] == '.')
						atPlace[i + 1][j] = 1;
					// if (i != (h - 1) && j != (w - 1) && i != 0 && j != 0
					// && table[i - 1][j + 1]=='.')
					// atPlace[i - 1][j + 1] = 1;
					if (j != (w - 1) && table[i][j + 1] == '.')
						atPlace[i][j + 1] = 1;
					// if (i != (h - 1) && j != (w - 1) && i != 0 && j != 0
					// && table[i + 1][j + 1]=='.')
					// atPlace[i + 1][j + 1] = 1;
				}
			}
		}

		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				if (atPlace[i][j] == 1)
					table[i][j] = '@';
			}
		}
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				if (table[i][j] == '@')
					aftAtNum++;
			}
		}
		if (befAtNum != aftAtNum) {
			return AtCheck(table, w, h);
		} else {
			return aftAtNum;
		}
	}

}