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.awt.Point;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;


public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int x, y;
		x = sc.nextInt();
		y = sc.nextInt();
		while (x != 0) {
			char map[][] = new char[y][x];
			load(sc, map);
			Queue<Point> que = new LinkedList<Point>();
			for (int i = 0;i < map.length;i ++) {
				for (int j = 0;j < map[i].length;j ++) {
					if (map[i][j] == '@') {
						que.add(new Point(j, i));
					}
				}
			}
			
			int dx[] = {-1, 0, 1, 0};
			int dy[] = {0, 1, 0, -1};
			int count = 0;
			while(!que.isEmpty()) {
				Point p = que.poll();
				if (p.x < 0 || p.x >= x || p.y < 0 || p.y >= y) continue;
				if (map[p.y][p.x] == '#') continue;
				count ++;
				map[p.y][p.x]= '#'; 
				for (int i = 0;i < 4;i ++) {
					que.add(new Point(p.x + dx[i], p.y + dy[i]));
				}
			}
			System.out.println(count);
			x = sc.nextInt();
			y = sc.nextInt();
		}
	}
	
	public static char[][] load(Scanner sc, char[][] map) {
		for (int i = 0;i < map.length;i ++) {
			map[i] = sc.next().toCharArray();
		}
		return map;
	}
}