#include <bits/stdc++.h>
using namespace std;
int n, m, s;
char a[110][110];
void dfs(int x, int y)
{
    if (x < 1 || y < 1 || x > n || y > m)
        return;
    if (a[x][y] == '*')
        return;
    a[x][y] = '*';
    dfs(x + 1, y);
    dfs(x - 1, y);
    dfs(x, y + 1);
    dfs(x, y - 1);
    dfs(x + 1, y + 1);
    dfs(x + 1, y - 1);
    dfs(x - 1, y + 1);
    dfs(x - 1, y - 1);
}
int main()
{
    while (cin >> n >> m && n != 0 && m != 0)
    {
        s = 0;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                cin >> a[i][j];
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                if (a[i][j] == '@')
                {
                    dfs(i, j);
                    s++;
                }
        cout << s << endl;
    }
    return 0;
}