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 {

	static int count = 0;
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int w = 0,h = 0;
		String str = "";
		int firstX = 0,firstY = 0;

		while(sc.hasNext()){
			
			count = 0;
			w = sc.nextInt();
			h = sc.nextInt();
			
			if(w == 0 && h == 0) break;
			
			char[][] tiles = new char[h][w];
			
			// テ」ツつソテ」ツつ、テ」ツδォテ、ツスツ愿ヲツ按?
			for(int i = 0;i<h;i++){
				str = sc.next();
				for(int j = 0;j<w;j++){
					tiles[i][j] = str.charAt(j);
					if(tiles[i][j]=='@'){
						firstX = j; 
						firstY = i;
					}
				}
			}
			
			// テ・ツ?催・ツクツーテゥツ鳴凝・ツァツ?
			walkTiles(firstY,firstX,tiles);
			
			System.out.println(count);
			
		}
	}
	
	static void walkTiles(int y,int x,char[][] tiles){
		if(y>tiles.length-1 || x<0 || y<0 || x>tiles[y].length-1) return;
		if(tiles[y][x] == '#') return;
		
		count++;
		tiles[y][x] = '#';
		
		// テ・ツ?催・ツクツーテゥツδィテ・ツ按?
		walkTiles(y-1,x,tiles);
		walkTiles(y,x+1,tiles); 
		walkTiles(y+1,x,tiles);
		walkTiles(y,x-1,tiles);
	}

}