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 {
	int ans, w,h;
	char [][] data;
	int [] vx = {0,1,0,-1};
	int [] vy = {1,0,-1,0};
	
	private void doit(){
		Scanner sc = new Scanner(System.in);
		while(true){
			w = sc.nextInt();
			h = sc.nextInt();
			if((w|h) == 0) break;
			data = new char[h][w];
			int sx = -1, sy = -1;
			for(int i = 0; i < h; i++){
				String s = sc.next();
				for(int j = 0 ; j < w; j++){
					data[i][j] = s.charAt(j);
					if(data[i][j] == '@'){
						data[i][j] = '.';
						sx = j;
						sy = i;
					}
				}
			}
			ans = 0;
			dfs(sx, sy);
			System.out.println(ans);
		}
	}

	private void dfs(int sx, int sy) {
		ans++;
		data[sy][sx] = '*';
		for(int i = 0 ; i < 4; i++){
			int yy = sy + vy[i];
			int xx= sx + vx[i];
			
			if(0 <= yy&& yy < h && 0<= xx && xx < w){
				if(data[yy][xx] == '.'){
					dfs(xx,yy);
				}
			}
		}
		
	}

	private int solvec(int n) {
		int a = n / 500;
		if(n % 500 != 0) a++;
		int aa = a / 3;
		int aaa = a% 3;
		double sum = (double)850 * aa * 3 * 88 / 100 + 850 * aaa;
		return (int)sum;
	}

	private int solveb(int n) {
		int a = n / 300;
		if(n % 300 != 0) a++;
		int aa = a / 4;
		int aaa = a% 4;
		double sum = (double)550 * aa * 4 * 85 / 100 + 550 * aaa;
		return (int)sum;
	}

	private int solvea(int n) {
		int a = n / 200;
		if(n % 200 != 0) a++;
		int aa = a / 5;
		int aaa = a% 5;
		double sum = (double)380 * aa * 5 * 8 / 10 + 380 * aaa;
		return (int)sum;
	}

	public static void main(String[] args) {
		Main obj = new Main();
		obj.doit();
	}
}