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


import java.util.Scanner;
import java.util.Stack;

public class Main 
{
	static class Spot
	{
		int x;
		int y;
		
		public Spot(int x, int y)
		{
			this.x = x;
			this.y = y;
		}
	}

	public static void main(String[] args) 
	{
		Scanner sc = new Scanner(System.in);
		while(true)
		{
			int w = sc.nextInt();
			if(w == 0)break;
			int h = sc.nextInt();
			boolean[][] grid = new boolean[w][h];
			
			int startx = -1;
			int starty = -1;
			
			for(int y = 0; y < h; y++)
			{
				String s = sc.next();
				for(int x = 0; x < w; x++)
				{
					grid[x][y] = (s.charAt(x) == '.' || s.charAt(x) == '@');
					if(!grid[x][y])
					{
//						System.out.println("WALL " + x + " " +y);
					}
					
					if(s.charAt(x) == '@')
					{
						startx = x;
						starty = y;
					}
				}
			}
			int count = 0;
			
			Stack<Spot> queue = new Stack<Spot>();
			
			queue.add(new Spot(startx, starty));
			
			while(!queue.isEmpty())
			{
				Spot spot = queue.pop();
				int x = spot.x;
				int y = spot.y;
				if(grid[x][y])
				{
					grid[x][y] = false;
					count++;
					
//					System.out.println("Add " + x + " " + y);
					
					if(x > 0 && grid[x-1][y])queue.add(new Spot(x-1, y));
					if(y > 0 && grid[x][y-1])queue.add(new Spot(x, y-1));
					if(x < w-1 && grid[x+1][y])queue.add(new Spot(x+1, y));
					if(y < h-1 && grid[x][y+1])queue.add(new Spot(x, y+1));
				}
				else
				{
//					System.out.println("False: " + x + " " + y);
				}
			}
			
			System.out.println(count);
		}


	}

}

