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 PYTHON3):

Solution:
# -*- coding: utf-8 -*-
'''
所要時間は、分位であった。
'''


# ライブラリのインポート
#import re #正規表現
import sys
input = sys.stdin.readline
#import heapq
#import bisect
#import collections
#import math
#from pprint import pprint

def main():
    while 1:
        w, h = map(int, input().split())
        if w == 0 and h == 0: break
        mp = []
        for i in range(h):
            mp.append(list(input().strip()))
            if "@" in mp[-1]:
                stj = mp[-1].index("@")
                sti = i
        flag = [[0]*w for i in range(h)]
        #pprint(flag)
        flag = dfs(sti, stj, flag, mp)
        ans = sum([flag[i].count(1) for i in range(h)])
        print(ans)
        #pprint(flag)
def dfs(rw, cm, flag, mp):
    flag[rw][cm] = 1
    #print(rw,cm)
    #pprint(flag)
    try:
        c = mp[rw][cm-1]
        b = flag[rw][cm-1]
    except: c = "#"
    if c == "." and b == 0 and rw>=0 and cm>0: dfs(rw, cm-1, flag, mp)
    try:
        c = mp[rw-1][cm]
        b = flag[rw-1][cm]
    except: c = "#"
    if c == "." and b == 0 and rw>0 and cm>=0: dfs(rw-1, cm, flag, mp)
    try: 
        c = mp[rw][cm+1]
        b = flag[rw][cm+1]
    except: c = "#"
    if c == "." and b == 0: dfs(rw, cm+1, flag, mp)
    try: 
        c = mp[rw+1][cm]
        b = flag[rw+1][cm]
    except: c = "#"
    if c == "." and b == 0: dfs(rw+1, cm, flag, mp)
    return flag


    


    
if __name__ == '__main__':
    main()