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 turn(char[][] f,int herew,int hereh,int w,int h){
		int cnt  = 0;
		f[hereh][herew] = '#';
		if(hereh>0)
			if(f[hereh-1][herew]=='.')
				cnt += turn(f,herew,hereh-1,w,h);
		if(hereh<h-1)
			if(f[hereh+1][herew]=='.')
				cnt += turn(f,herew,hereh+1,w,h);
		if(herew>0)
			if(f[hereh][herew-1]=='.')
				cnt += turn(f,herew-1,hereh,w,h);
		if(herew<w-1)
			if(f[hereh][herew+1]=='.')
				cnt += turn(f,herew+1,hereh,w,h);
		return cnt+1;
	}
	
    public static void main(String[] args) {
        try(Scanner sc = new Scanner(System.in)){
        	while(sc.hasNext()) {
        		int w = sc.nextInt();
        		int h = sc.nextInt();
        		if(w+h==0)break;
        		char[][] f = new char[h+1][w+1];
        		int hereh = 0;
        		int herew = 0;
        		for(int i=0;i<h;i++) {
        			String str =sc.next();
        			for(int j=0;j<w;j++) {
        				f[i][j] = str.charAt(j);
        				if(f[i][j]=='@') {
        					hereh =i;
        					herew = j;
        					f[i][j]='#';
        				}
        			}
        		}
        		
        		System.out.println(turn(f,herew,hereh,w,h));
        	}
        }
    }
}