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);
        StringBuilder sb = new StringBuilder();
        while (true) {
            int w = sc.nextInt();
            int h = sc.nextInt();
            if (w == 0 && h == 0) {
                break;
            }
            char[][] field = new char[h][];
            int ww = 0;
            int hh = 0;
            for (int i = 0; i < h; i++) {
                field[i] = sc.next().toCharArray();
                for (int j = 0; j < w; j++) {
                    if (field[i][j] == '@') {
                        ww = j;
                        hh = i;
                        field[i][j] = '.';
                    }
                }
            }
            Counter cn = new Counter();
            search(hh, ww, field, cn);
            sb.append(cn.count).append("\n");
        }
        System.out.print(sb);
    }
    
    static void search(int hh, int ww, char[][] field, Counter cn) {
        if (hh < 0 || hh >= field.length || ww < 0 || ww >= field[hh].length || field[hh][ww] != '.') {
            return;
        }
        cn.up();
        field[hh][ww] = '#';
        search(hh - 1, ww, field, cn);
        search(hh + 1, ww, field, cn);
        search(hh, ww - 1, field, cn);
        search(hh, ww + 1, field, cn);
    }
    
    static class Counter {
        int count = 0;
        
        public void up() {
            count++;
        }
    }
}