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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws IOException {

		int x0 = 9, y0 = 9;
		// int count = 0;
		int[] count = new int[500];
		int dataset = 0;

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		// StringBuffer sb = new StringBuffer(new String(br.readLine()));
		// int x = Character.getNumericValue(sb.charAt(0));
		// int y = Character.getNumericValue(sb.charAt(2));

		for (dataset = 0; dataset < 500; dataset++) {

			int k = 0;
			String str = br.readLine();
			String box[] = str.split(" ");
			int x = Integer.parseInt(box[0]);
			int y = Integer.parseInt(box[1]);

			if (x == 0 && y == 0) {
				break;
			} else {

				boolean[][] can = new boolean[x][y];
				boolean[][] black = new boolean[x][y];

				for (int j = 0; j < y; j++) {

					StringBuffer sb = new StringBuffer(new String(br.readLine()));
					for (int i = 0; i < x; i++) {
						if (sb.charAt(i) == '#') {
							black[i][j] = false;
						} else {
							if (sb.charAt(i) == '@') {
								x0 = i;
								y0 = j;
							}
							black[i][j] = true;
						}
					} // iのループ
				} // jのループ

				can[x0][y0] = true;

				int px = x0;
				int py = y0;

				do {
					for (int j = 0; j < y; j++) {
						for (int i = 0; i < x; i++) {
							if (can[i][j]) {
								px = i;
								py = j;

								if (py > 0) {
									if (black[px][py - 1]) {// 上
										can[px][py - 1] = true;
									}
								}

								if (py < y - 1) {
									if (black[px][py + 1]) {// 下
										can[px][py + 1] = true;
									}
								}

								if (px > 0) {
									if (black[px - 1][py]) {// 左
										can[px - 1][py] = true;
									}
								}

								if (px < x - 1) {
									if (black[px + 1][py]) {// 右
										can[px + 1][py] = true;
									}
								}
							}

						}
					}
					k++;
				} while (k < x * y);

				for (int j = 0; j < y; j++) {
					for (int i = 0; i < x; i++) {
						if (can[i][j]) {
							count[dataset]++;
						}
					}
				}
			}
		}
		for (dataset = 0; dataset < 500; dataset++) {
			if (count[dataset] == 0) {
				break;
			}
			System.out.println(count[dataset]);
		}

	}// main

}// class