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
def move_a(y,x,count):
    count += 1
    li[x][y] = "#"
    if li[x-1][y] == ".":
        count = move_a(y,x-1,count)
    if li[x+1][y]== ".":
        count = move_a(y,x+1, count)
    if li[x][y-1]== ".":
        count = move_a(y-1,x, count)
    if li[x][y+1]== ".":
        count = move_a(y+1,x, count)
    return count

while True:
    yoko, tate = map(int,raw_input().split())
    if yoko == 0 and tate == 0:
        break
    li = []
    rec_list = []
    count = 0
    li.append(["#"] * (yoko + 2))

    for i in range(tate):
        temp = raw_input()
        temp = "#" + temp +"#"
        li.append(list(temp))
    li.append(["#"]*(yoko+2))
    for i in li:
        if '@' in i:
            a_posx,a_posy = i.index('@'),li.index(i)
    print move_a(a_posx,a_posy,count)