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
#include<iostream>
#include <functional>
#include<algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;

int W,H;
char a[30][30];
void se(int x,int y,int (*re)[30],int *u){
	
	if(x<0||W<=x||y<0||H<=y||a[y][x]=='#')
		return;
	if(re[y][x]==1)
		return;
	
	re[y][x]=1;
		*u+=1;
	
	se(x+1,y,re,u);
	se(x-1,y,re,u);
	se(x,y+1,re,u);
	se(x,y-1,re,u);
}

int main(){
	int x,y;
	int x1,y1;
	while(cin>>W>>H){
		if(W!=0&&H!=0){
			int re[30][30]={0};
			int u=0;
		for(int i=0;i<H;i++){
			for(int j=0;j<W;j++){
			cin>>a[i][j];
				if(a[i][j]=='@'){
				x1=j;
				y1=i;}
			}
		}
			se(x1,y1,re,&u);
				cout<<u<<endl;
		}
		else
			break;
	}

	
}