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 w;
	static int h;
	static char[][] tiles;
	static boolean[][] check;
	static int count;
	
	static int go(int i,int j,int count) {
		if(!check[i][j]) {
			check[i][j] = true;
			count++;
			if(i-1>=0 && tiles[i-1][j] == '.') {
				//System.err.println(count);
				count = go(i-1,j,count);
			}
			if(i+1<h && tiles[i+1][j] == '.') {
				//System.err.println(count);
				count = go(i+1,j,count);
			}
			if(j-1>=0 && tiles[i][j-1] == '.') {
				//System.err.println(count);
				count = go(i,j-1,count);
			}
			if(j+1<w && tiles[i][j+1] == '.') {
				//System.err.println(count);
				count = go(i,j+1,count);
			}
		}
		return count;
	}
	
	
    public static void main(String[] args) {
    	Scanner sc = new Scanner(System.in);
    	while(true) {
    		w = Integer.parseInt(sc.next());
    		h = Integer.parseInt(sc.next());
    		if(w==0 && h==0) break;
    		tiles = new char[h][w];
    		check = new boolean[h][w];
    		for(int i=0;i<h;i++) {
    			tiles[i] = sc.next().toCharArray();
    		}
    		/*for(int i=0;i<h;i++) {
    			for(int j=0;j<w;j++) {
    				System.out.print(tiles[i][j]+" ");
    			}
    			System.out.println();
    		}*/
    		int m = 0;
    		int n = 0;
    		loop:for(int i=0;i<h;i++) {
    			for(int j=0;j<w;j++) {
    				if(tiles[i][j] == '@') {
    					m = i;
    					n = j;
    					break loop;
    				}
    			}
    		}
    		int count = go(m,n,0);
    		System.out.println(count);
    	}
    }
}