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.io.PrintWriter;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		solve();
	}

	private static void solve() {
		Scanner scn = new Scanner(System.in);
		PrintWriter pr = new PrintWriter(System.out);
		while(true){
			int W = scn.nextInt();
			int H = scn.nextInt();
			int count=0;
			if(W==0&&H==0) break;
			char[][] map = new char[H+2][W+2];
			for(int x=0;x<H+2;x++){
				for(int y=0;y<W+2;y++){
					map[x][y]='#';
				}
			}
			int startx=1;
			int starty=1;
			for(int x=1;x<H+1;x++){
				String tmp=scn.next();
				for(int y=1;y<W+1;y++){
					map[x][y]=tmp.charAt(y-1);
					if(map[x][y]=='@'){
						startx=x;
						starty=y;
					}
					if(map[x][y]=='.'){
						count++;
					}
				}
			}
			mapcount(map,startx,starty);
			for(int x=1;x<H+1;x++){
				for(int y=1;y<W+1;y++){
					if(map[x][y]=='.'){
						count--;
					}
				}
			}
			pr.println(count+1);
		}
		pr.flush();
		scn.close();
	}

	private static void mapcount(char[][] map, int startx, int starty) {
		if(map[startx][starty+1]=='.'){
			map[startx][starty+1]='#';
			mapcount(map,startx,starty+1);
		}
		if(map[startx+1][starty]=='.'){
			map[startx+1][starty]='#';
			mapcount(map,startx+1,starty);
		}
		if(map[startx][starty-1]=='.'){
			map[startx][starty-1]='#';
			mapcount(map,startx,starty-1);
		}
		if(map[startx-1][starty]=='.'){
			map[startx-1][starty]='#';
			mapcount(map,startx-1,starty);
		}
		
	}

}