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.*;
public class Main {
    public static void main(String[] args) {
      Scanner sc = new Scanner(System.in);
      while(true){
      int N = sc.nextInt();
      int M = sc.nextInt(); sc.nextLine(); //nextIntの後残る改行文字を消す
      if(N==0&&M==0){break;}
      int count=0;
      String[] line = new String[M];
      for(int i=0;i<M;i++){
      	line[i]=sc.nextLine();
      } 
      String[][] a = new String[N][M];
      for(int j=0;j<M;j++){
       for(int k=0;k<N;k++){
        a[k][j]=String.valueOf(line[j].charAt(k));
       }
      }
      for(int t=0;t<60;t++){
       for(int p=0;p<M;p++){
        for(int q=0;q<N;q++){
         if((a[q][p].equals("@"))&&(a[Math.max(0,q-1)][p].equals("."))){
         	a[Math.max(0,q-1)][p]="@";
         }
         if((a[q][p].equals("@"))&&(a[q][Math.max(0,p-1)].equals("."))){
         	a[q][Math.max(0,p-1)]="@";
         }
         if((a[q][p].equals("@"))&&(a[Math.min(N-1,q+1)][p].equals("."))){
         	a[Math.min(N-1,q+1)][p]="@";
         }
         if((a[q][p].equals("@"))&&(a[q][Math.min(M-1,p+1)].equals("."))){
         	a[q][Math.min(M-1,p+1)]="@";
         }
        }
       }
      }
      for(int r=0;r<M;r++){
       for(int s=0;s<N;s++){
         if(a[s][r].equals("@")){
         	count++;
         }
       }
      }
     System.out.println(count);
      }
   }
}