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

class P
{
	int x;
	int y;
	P(int x, int y)
	{
		this.x = x;
		this.y = y;
	}
}
public class Main 
{
	static int[] dx = {1, 0, -1, 0};
	static int[] dy = {0, -1, 0, 1};
	public static void main(String[] args) 
	{
		Scanner stdIn = new Scanner(System.in);
		while(stdIn.hasNext())
		{
			int W = stdIn.nextInt();
			int H = stdIn.nextInt();
			if(W == 0 && H == 0)
			{
				break;
			}
			char[][] field = new char[H][W];
			Queue<P> que = new ArrayDeque<P>();
			for(int i = 0; i < H; ++i)
			{
				String s = stdIn.next();
				for(int j = 0; j < W; ++j)
				{
					if(s.charAt(j) == '@')
					{
						P p = new P(j, i);
						que.add(p);
						field[i][j] = '#';
					}
					else
					{
						field[i][j] = s.charAt(j);
					}
				}
			}
			int count = 1;
			while(!que.isEmpty())
			{
				P p = que.poll();
				for(int i = 0; i < dx.length; ++i)
				{
					P np = new P(0, 0);
					np.x = p.x + dx[i];
					np.y = p.y + dy[i];
					if((0 <= np.x && np.x < W) && (0 <= np.y && np.y < H) && field[np.y][np.x] == '.')
					{
						que.add(np);
						field[np.y][np.x] = '#';
						++count;
					}
				}
			}
			System.out.println(count);
		}
	}
}