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

public class Main {

	private static int h;
	private static int w;
	static boolean[][] access;
	static boolean[][] map;
	static int cnt;
	
	static void Search(int x, int y){
		if(!access[x][y]){
			cnt++;
			access[x][y]=true;
			if(x+1<h&&map[x+1][y]){
				Search(x+1,y);
			}
			if(y+1<w&&map[x][y+1]){
				Search(x,y+1);
			}
			if(x-1>=0&&map[x-1][y]){
				Search(x-1,y);
			}
			if(y-1>=0&&map[x][y-1]){
				Search(x,y-1);
			}
		}
	}
	
	public static void main(String[] args) throws IOException {
		Scanner stdIn = new Scanner(System.in);

		while(true){
			w = stdIn.nextInt();
			h = stdIn.nextInt();
			if(w==0&&h==0){
				return;
			}
			access = new boolean[h][w];
			map = new boolean[h][w];
			int x = -1, y = -1;
			for(int i=0;i<h;i++){
				char[] tmp = stdIn.next().toCharArray();
				for(int j=0;j<w;j++){
					if(tmp[j]=='.'){
						map[i][j]=true;
					}
					else if(tmp[j]=='@'){
						x = i;
						y = j;
					}
				}
			}
			cnt = 0;
			Search(x,y);
			System.out.println(cnt);
		}
	}
}