1 #include <cstdio>
 2 #include <string>
 3 #include <iostream>
 4 #include <algorithm>
 5 #include <string.h>
 6 #include <math.h>
 7 #include <vector>
 8
 9 using namespace std;
10
11 const int maxn = 30;
12
13 char ss[maxn][maxn];
14 int mx[] = {0,0,1,-1};
15 int my[] = {1,-1,0,0};
16 int vis[maxn][maxn];
17 int n,m;
18 int cnt = 0;
19
20 bool check(int i,int j)
21 {
22     if (ss[i][j] == '.' && !vis[i][j])
23         return true;
24     return false;
25 }
26
27 void dfs(int row,int col)
28 {
29     for (int i=0;i<4;i++)
30     {
31         int nx = row + mx[i];
32         int ny = col + my[i];
33         if (check(nx,ny))
34         {
35             cnt++;
36             vis[nx][ny] = 1;
37             dfs(nx,ny);
38         }
39     }
40
41 }
42
43
44 int main() {
45     while (cin >> m >> n) {
46         if (m == 0 && n == 0)
47             return 0;
48         bool flag = false;
49         cnt = 0;
50         memset(vis,0, sizeof(vis));
51         memset(ss,'#', sizeof(ss));
52         for (int i = 1; i <= n; i++) {
53             for (int j = 1; j <= m; j++) {
54                 cin >> ss[i][j];
55             }
56         }
57         for (int i = 1; i <= n; i++) {
58             for (int j = 1; j <= m; j++) {
59                 if (ss[i][j] == '@') {
60                     dfs(i, j);
61                     printf("%d\n", cnt + 1);
62                     flag = true;
63                     break;
64                 }
65             }
66             if (flag)
67                 break;
68         }
69     }
70 }