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.*;
import java.text.*;

public class Main {
	static class Data{
		int x,y;
		public Data(int xx, int yy){
			x = xx;
			y = yy;
		}
	}
	
	public static void main(String args[]){
		Scanner in = new Scanner(System.in);
		while(true){
			int w = in.nextInt();
			int h = in.nextInt();
			if((w|h)==0) break;
			boolean[][] field = new boolean[h][w];
			int[][] counter = new int[h][w];
			int sx=0,sy=0;
			
			for(int i=0; i<h; i++){
				String str = in.next();
				char[] ch = str.toCharArray();
				for(int j=0; j<w; j++){
					counter[i][j] = 0;
					if(ch[j]=='#') field[i][j] = false;
					else{
						field[i][j] = true;
						if(ch[j] == '@'){
							sx = i;
							sy = j;
							counter[i][j] = 1;
						}
					}
				}
			}
			
			LinkedList<Data> queue = new LinkedList<Data>();
			queue.add(new Data(sx,sy));
			while(!queue.isEmpty()){
				Data now = queue.poll();
				if(now.x>0 && field[now.x-1][now.y] && counter[now.x-1][now.y]==0){
					counter[now.x-1][now.y]=1;
					queue.add(new Data(now.x-1,now.y));
				}
				if(now.y>0 && field[now.x][now.y-1] && counter[now.x][now.y-1]==0){
					counter[now.x][now.y-1]=1;
					queue.add(new Data(now.x,now.y-1));
				}
				if(now.x<h-1 && field[now.x+1][now.y] && counter[now.x+1][now.y]==0){
					counter[now.x+1][now.y]=1;
					queue.add(new Data(now.x+1,now.y));
				}
				if(now.y<w-1 && field[now.x][now.y+1] && counter[now.x][now.y+1]==0){
					counter[now.x][now.y+1]=1;
					queue.add(new Data(now.x,now.y+1));
				}
			}
			
			int ans = 0;
			for(int i=0; i<h; i++){
				for(int j=0; j<w; j++){
					ans += counter[i][j];
				}
			}
			
			System.out.println(ans);
		}
	}
}