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 {
	int w, h;
	int[][] map;
	int[][] cost;
	
	public void loop(int y, int x){
		cost[y][x]++;
		if(x!=0 && map[y][x-1]==0 && cost[y][x-1]==0){
			loop(y,x-1);
		}
		if(x!=w-1 && map[y][x+1]==0 && cost[y][x+1]==0){
			loop(y,x+1);
		}
		if(y!=0 && map[y-1][x]==0 && cost[y-1][x]==0){
			loop(y-1,x);
		}
		if(y!=h-1 && map[y+1][x]==0 && cost[y+1][x]==0){
			loop(y+1,x);
		}	
	}
	
	public void check(){
		int count=0;
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				if(cost[i][j]>0)count++;
			}
		}
		System.out.println(count);
	}
	

	public static void main(String[] args) {
		Main A = new Main();
		Scanner sc = new Scanner(System.in);
		
		while(true){
			A.w = sc.nextInt();
			A.h = sc.nextInt();
			if((A.w|A.h)==0)break;
			
			A.map = new int[A.h][A.w];
			A.cost = new int[A.h][A.w];
			
			String t = "";
			int x = 0;
			int y = 0;
			for(int i=0;i<A.h;i++){
				t = sc.next();
				for(int j=0;j<A.w;j++){
					if(t.codePointAt(j)==35){
						A.map[i][j] = 1;
					}else if(t.codePointAt(j)==64){
						A.map[i][j] = 2;
						x = j;
						y = i;
					}
				}
			}
			A.loop(y, x);
			A.check();
		}
	}
}