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.*;

public class Main {
	public static void main(String[] args){
		new Main().calc();
	}

	String[] board;
	boolean[][] dp;
	int h,w;
	int[] vx = new int[]{1,0,-1,0};
	int[] vy = new int[]{0,1,0,-1};
	int ret = 0;

	void calc(){
		Scanner cin = new Scanner(System.in);
		while(true){
			w = cin.nextInt();
			h = cin.nextInt();
			if(w==0) break;
			int i,j;
			ret = 0;
			board = new String[h];
			dp = new boolean[h][w];
			for(i=0;i<h;i++){
				board[i] = cin.next();
			}
			for(i=0;i<h;i++){
				for(j=0;j<w;j++){
					if(board[i].charAt(j)=='@'){
						ret = 1;
						dp[i][j] = true;
						dfs(i,j);
					}
				}
			}
			System.out.println(ret);
		}
	}

	void dfs(int y, int x){
		for(int i=0;i<4;i++){
			int ny = y + vy[i];
			int nx = x + vx[i];
			if(ok(ny,nx)){
				ret++;
				dp[ny][nx] = true;
				dfs(ny,nx);
			}
		}
	}

	boolean ok(int y, int x){
		return y>= 0 && x>=0 && y<h && x<w && board[y].charAt(x)=='.' && !dp[y][x];
	}
}