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.*;
public class Main {
	Scanner sc;
	int w;
	int h;
	int[][] map;
	P s;
	int count;
	boolean[][] visited;
	void run() {
		sc = new Scanner(System.in);
		while (true) {
			count =0;
			w = sc.nextInt();
			h = sc.nextInt();
			if(w==0 && h ==0) break;
			visited = new boolean[h+2][w+2];
			map = new int[h+2][w+2];
			for (int i=1;i<h+1;i++) {
				String str = sc.next();
				for (int j=1;j<w+1;j++) {
					visited[i][j] = false;
					if (str.charAt(j-1)=='.') visited[i][j] = true;
					else if(str.charAt(j-1)=='#') visited[i][j] = false;
					else if(str.charAt(j-1) == '@'){
						visited[i][j] = true;
						s = new P(j,i);
					}
					
					
				}
			}
			count = 0;
			solve(s);
			System.out.println(count);
			
		}
	}
	int dx[] = {-1,0,1,0};
	int dy[] = {0,-1,0,1};
	void solve(P p) {
		count++;
		visited[p.y][p.x] = false;
		for (int i=0;i<4;i++) 
			if (visited[p.y+dy[i]][p.x+dx[i]]) solve(new P(p.x+dx[i],p.y+dy[i])); 
	}
		
	
	
	class P {
		int x;
		int y;
		P(int x,int y) {
			this.x = x;
			this.y = y;
		}
	}
	public static void main(String[] args) {
		new Main().run();
	}
}