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

public class Main {
	
	public static class Pos{
		int x, y;

		public Pos(int x, int y) {
			super();
			this.x = x;
			this.y = y;
		}
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		while(true){
			final int W = sc.nextInt();
			final int H = sc.nextInt();
			
			if(W == 0 && H == 0){
				break;
			}
			
			boolean[][] is_visited = new boolean[H][W];
			boolean[][] is_wall = new boolean[H][W];
			
			int s_x = -1, s_y = -1;
			
			for(int i = 0; i < H; i++){
				char[] ch = sc.next().toCharArray();
				
				for(int j = 0; j < W; j++){
					is_visited[i][j] = false;
					is_wall[i][j] = ch[j] == '#';
					
					if(ch[j] == '@'){
						s_x = j;
						s_y = i;
					}
				}
			}
			
			LinkedList<Pos> queue = new LinkedList<Pos>();
			
			queue.add(new Pos(s_x, s_y));
			int count = 0;
			
			while(!queue.isEmpty()){
				Pos pos = queue.poll();
				
				if(is_visited[pos.y][pos.x]){
					continue;
				}
				
				is_visited[pos.y][pos.x] = true;
				count++;
				
				if(pos.x != 0 && !is_wall[pos.y][pos.x - 1] && !is_visited[pos.y][pos.x - 1]){
					queue.add(new Pos(pos.x - 1, pos.y));
				}
				
				if(pos.x != W-1 && !is_wall[pos.y][pos.x + 1] && !is_visited[pos.y][pos.x + 1]){
					queue.add(new Pos(pos.x + 1, pos.y));
				}
				
				if(pos.y != 0 && !is_wall[pos.y - 1][pos.x] && !is_visited[pos.y - 1][pos.x]){
					queue.add(new Pos(pos.x, pos.y - 1));
				}
				
				if(pos.y != H-1 && !is_wall[pos.y + 1][pos.x] && !is_visited[pos.y + 1][pos.x]){
					queue.add(new Pos(pos.x, pos.y + 1));
				}
			}
			
			System.out.println(count);
		}
		
	}
}