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


public class Main {
	void run(){
		Scanner s = new Scanner(System.in);
		while(true){
			int w = s.nextInt();
			int h = s.nextInt();
			if(w == 0 && h == w)break;
			int x = 0;
			int y = 0;
			String tile[][] = new String[h][w];
			for(int i = 0;i < h;i++){
				tile[i] = s.next().split("");
				for(int j = 0;j < w;j++){
					if(tile[i][j].charAt(0) == '@'){
						x = i;
						y = j;
					}
				}
			}
			int chkP[][] = new int[h][w];
			int cnt = cntTile(tile,chkP,'.',x,y);
			System.out.println(cnt);
		}
	}
	
	int cntTile(String[][] panel,int[][] chkP,char tile,int x,int y){
		chkP[x][y] = -1; 
		int cnt = 0;
		if(x + 1 < panel.length    && chkP[x + 1][y] != -1 && panel[x + 1][y].charAt(0) == tile)cnt += cntTile(panel,chkP,tile,x + 1,y);
		if(x     > 0               && chkP[x - 1][y] != -1 && panel[x - 1][y].charAt(0) == tile)cnt += cntTile(panel,chkP,tile,x - 1,y);
		if(y + 1 < panel[x].length && chkP[x][y + 1] != -1 && panel[x][y + 1].charAt(0) == tile)cnt += cntTile(panel,chkP,tile,x,y + 1);
		if(y     > 0               && chkP[x][y - 1] != -1 && panel[x][y - 1].charAt(0) == tile)cnt += cntTile(panel,chkP,tile,x,y - 1);
		cnt++;
		return cnt;
	}
	
	public static void main(String args[]){
		new Main().run();
	}
}