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.*;
import java.lang.*;
import java.math.*;

public class Main {
	Scanner sc = new Scanner(System.in);

	void run() {
		for (;;) {
			int w = sc.nextInt();
			int h = sc.nextInt();

			if ((w | h) == 0) {
				break;
			}

			int value[][] = new int[h][w];

			for (int i = 0; i < h; i++) {
				String buffer = sc.next();
				for (int j = 0; j < w; j++) {
					switch (buffer.charAt(j)) {
					case '.':
						value[i][j] = 1;
						break;
					case '@':
						value[i][j] = 2;
						break;
					}
				}
			}

			int dx[] = { -1, 1, 0, 0 };
			int dy[] = { 0, 0, 1, -1 };

			int z=0;
			int sum = 0;
			for (int c = 0; c < 403; c++) {
				z=0;
				for (int i = 0; i < h; i++) {
					for (int j = 0; j < w; j++) {
						if (value[i][j] == 2) {
							for (int k = 0; k < 4; k++) {
								int ni = i + dy[k];
								int nj = j + dx[k];

								if(ni < 0){
									continue;
								}
								if(ni >= h){
									continue;
								}
								if(nj < 0){
									continue;
								}
								if(nj >= w){
									continue;
								}
								if(value[ni][nj] == 1){
									value[ni][nj] = 2;
								}
							}
							value[i][j] = 3;
							z++;
						}
					}
				}
				sum += z;
				if(z == 0){
					break;
				}
			}
			System.out.println(sum);
		}

	}

	public static void main(String[] args) {
		Main m = new Main();
		m.run();
	}
}