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

public class Main {
	public Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		new Main();
	}
	public Main() {
		new aoj1130().doIt();
	}
	class aoj1130{
		boolean map[][];
		int x[] = {-1,1,0,0};
		int y[] = {0,0,-1,1};
		int H,W;
		int cnt = 0;
		
		void dfs(int h,int w){
			if(map[h][w]){
				cnt++;
				map[h][w] = false;
			}
			for(int i = 0;i < 4;i++){
				if(h + y[i] < H && w + x[i] < W && h + y[i] >= 0 && w + x[i] >= 0){
					if(map[h + y[i]][w + x[i]] == true){
						dfs(h+y[i],w+x[i]);
					}
				}
			}
		}
		
		void doIt() {
			while (true) {
				W = sc.nextInt();
				H = sc.nextInt();
				if(H + W == 0)break;
				map = new boolean[H][W];
				int sh = 0,sw = 0;
				for(int h = 0;h < H;h++){
					String str = sc.next();
					char ctr[] = str.toCharArray();
					for(int w = 0;w < W;w++){
						if(ctr[w] == '.') map[h][w] = true;
						else if(ctr[w] == '@'){
							map[h][w] = true;
							sh = h;
							sw = w;
						}
					}
				}
				dfs(sh,sw);
				System.out.println(cnt);
				cnt = 0;
			}
		}
	}
}