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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line = "";

        while (!(line = br.readLine()).equals("0 0")) {
            int w = Integer.parseInt(line.substring(0, line.indexOf(' ')));
            int h = Integer.parseInt(line.substring(line.indexOf(' ') + 1));
            char[][] map = new char[h + 2][w + 2];

            ArrayDeque<int[]> queue = new ArrayDeque<int[]>();
            int count = 0;

            for (int i = 1; i < h + 1; i++) {
                line = br.readLine();
                for (int j = 1; j < w + 1; j++) {
                    map[i][j] = line.charAt(j - 1);
                    if (map[i][j] == '@') {
                        queue.offer(new int[]{i, j});
                        map[i][j] = '#';
                        count++;
                    }
                }
            }

            int[][] dir = new int[][]{{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
            while (queue.size() > 0) {

                int[] curr = queue.poll();
                char tile;
                for (int i = 0; i < dir.length; i++) {
                    tile = map[curr[0] + dir[i][0]][curr[1] + dir[i][1]];
                    if (tile == '.') {
                        queue.offer(new int[]{
                                curr[0] + dir[i][0], curr[1] + dir[i][1]
                        });
                        map[curr[0] + dir[i][0]][curr[1] + dir[i][1]] = '#';
                        count++;
                    }
                }
            }
            System.out.println(count);
        }
    }
}