L

#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

int n, m;
const int maxn = 105;
string s[maxn];
int f[8][2] = { {0, 1},{1, 0},{-1, 0},{0, -1},{1, 1},{-1, -1},{1, -1},{-1, 1} };

struct node{
    int x, y;
}now, last;
queue<node>q;
void bfs(int x, int y){
    while(!q.empty())   q.pop();
    last.x = x;
    last.y = y;
    q.push(last);
    s[x][y] = '*';
    while(!q.empty()){
        last = q.front(); q.pop();
        for(int i = 0;i < 8;i++){
            now.x = last.x + f[i][0];
            now.y = last.y + f[i][1];

            if(now.x < 0 || now.y < 0|| now.x >= n || now.y >= m|| s[now.x][now.y] == '*')
                continue;
            q.push(now);
            s[now.x][now.y] = '*';
        }
    }
}

int main(){
    while(cin >> n >> m){
        if(n == 0 && m == 0 )
            break;
        for(int i = 0;i < n;i++)
            cin >> s[i];
        int ans = 0;
        for(int i = 0;i < n;i++){
            for(int j = 0;j < m;j++){
                if(s[i][j] == '@'){
                    ans++;
                    bfs(i, j);
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}