#include <bits/stdc++.h>

using namespace std;

char g[25][25];
int st[25][25];
int cnt;
int n, m;

void dfs(int x, int y)
{
    cnt ++;
    st[x][y] = 1;

    int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

    for(int i = 0; i < 4; i ++)
    {
        int xx = x + dx[i], yy = y + dy[i];

        if(xx >= 0 and xx < n and yy >= 0 and yy < m and !st[xx][yy] and g[xx][yy] == '.')
            dfs(xx, yy);
    }
}

int main()
{
    while(cin >> m >> n, m)
    {
        cnt = 0;
        memset(st, 0, sizeof st);

        int x, y;

        for(int i = 0; i < n; i ++)
            for(int j = 0; j < m; j ++)
            {
                cin >> g[i][j];

                if(g[i][j] == '@')
                    x = i, y = j;
            }

        dfs(x, y);

        cout << cnt << endl;
    }
}