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

/**
 * Created by macbookpro on 2017/07/10.
 */
public class Main {
    static int[][] array;
    static int counter=1;
    static int w;
    static int h;
    static boolean[][] confirm;

    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);

        while(true){
            String[] firstLine=sc.nextLine().split(" ");


            w=Integer.parseInt(firstLine[0]);
            if(w==0){
                break;
            }

            h=Integer.parseInt(firstLine[1]);
            array=new int[h][w];
            confirm=new boolean[h][w];


            for(boolean[] tmp:confirm){
                Arrays.fill(tmp,false);
            }



            int sh=0;
            int sw=0;


            for(int i=0; i<h; i++){
                String tiles=sc.nextLine();

                for(int j=0; j<w; j++){
                    char cell= tiles.charAt(j);

                    if(cell=='.') {
                        array[i][j]=1;//??????1??§??¨???
                    }else if(cell=='#'){
                        array[i][j]=0;//??????0??§??¨???
                    }else{
                        array[i][j]=1;
                        sh=i;
                        sw=j;
                    }
                }
            }



            counter=1;

            confirm[sh][sw]=true;

            if(sw!=w-1 && array[sh][sw+1]==1) {
                rightmove(sh,sw+1);
            }

            if(sh!=0&&array[sh-1][sw]==1){
                upmove(sh-1,sw);
            }

            if(sh!=h-1 && array[sh+1][sw]==1){
                downmove(sh+1,sw);
            }

            if (sw != 0 && array[sh][sw - 1] == 1) {
                leftmove(sh,sw-1);
            }



            System.out.println(counter);
        }
    }



    static void rightmove(int m, int n){

       if(confirm[m][n]!=true){
           counter++;
           confirm[m][n]=true;

           if(n!=w-1 && array[m][n+1]==1) {
               rightmove(m, n + 1);
           }if(m!=h-1 && array[m+1][n]==1){
               downmove(m+1,n);
           }if(m!=0&&array[m-1][n]==1){
               upmove(m-1,n);
           }
       }



    }


    static void leftmove(int m, int n){

        if(confirm[m][n]!=true){

            counter++;
            confirm[m][n] = true;

            if (n != 0 && array[m][n - 1] == 1) {
                leftmove(m,n-1);
            }
            if (m != h - 1 && array[m + 1][n] == 1) {
                downmove(m + 1, n);
            }
            if (m != 0 && array[m - 1][n] == 1) {
                upmove(m - 1, n);
            }
        }
    }


    static void upmove(int m, int n){

        if(confirm[m][n]!=true){

            counter++;
            confirm[m][n] = true;
            if (n != w - 1 && array[m][n + 1] == 1) {
                rightmove(m, n + 1);
            }
            if (n != 0 && array[m][n - 1] == 1) {
                leftmove(m, n - 1);
            }
            if (m != 0 && array[m - 1][n] == 1) {
                upmove(m - 1, n);
            }
        }
    }


    static void downmove(int m, int n){
        if(confirm[m][n]!=true){

            counter++;
            confirm[m][n] = true;
            if (n != w - 1 && array[m][n + 1] == 1) {
                rightmove(m, n + 1);
            }
            if (n != 0 && array[m][n - 1] == 1) {
                leftmove(m, n - 1);
            }
            if (m != h-1 && array[m + 1][n] == 1) {
                downmove(m + 1, n);
            }

        }
    }
}