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.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while(true){
			int w=sc.nextInt();
			int h=sc.nextInt();
			String gomi = sc.nextLine();
			if(w==0&&h==0) break;
			int[][] map = new int[h][w];
			int start_w=0,start_h=0;
			for(int i=0;i<h;++i){
				String line = sc.nextLine();
				String[] line2=line.split("");
				for(int j=0;j<w;++j){
					if(line2[j].equals("#")){
						map[i][j]=-1;
					} else if(line2[j].equals("@")){
						map[i][j]=1;
						start_w=j; start_h=i;
					}
				}
			}
			int[][] flag = new int[h][w];
			flag[start_h][start_w]=1;
			int count=1;
			Queue<Node> queue = new LinkedList<Node>();
			queue.add(new Node(start_h, start_w));
			while(!queue.isEmpty()){
				Node cur = queue.remove();
				if(cur.h!=0){
					if(map[cur.h-1][cur.w]==0 && flag[cur.h-1][cur.w]==0){
						count++; flag[cur.h-1][cur.w]=1;
						queue.add(new Node(cur.h-1,cur.w));
					}
				}
				if(cur.h!=h-1){
					if(map[cur.h+1][cur.w]==0 && flag[cur.h+1][cur.w]==0){
						count++; flag[cur.h+1][cur.w]=1;
						queue.add(new Node(cur.h+1,cur.w));
					}
				}
				if(cur.w!=0){
					if(map[cur.h][cur.w-1]==0 && flag[cur.h][cur.w-1]==0){
						count++; flag[cur.h][cur.w-1]=1;
						queue.add(new Node(cur.h,cur.w-1));
					}
				}
				if(cur.w!=w-1){
					if(map[cur.h][cur.w+1]==0 && flag[cur.h][cur.w+1]==0){
						count++; flag[cur.h][cur.w+1]=1;
						queue.add(new Node(cur.h,cur.w+1));
					}
				}
			}
			System.out.println(count);
		}
	}
}
class Node{
	int h,w;
	Node(int w,int h){
		this.h=w;
		this.w=h;
	}
}