#include <bits/stdc++.h>
using namespace std;

const int N = 105;
char mp[N][N];
bool visited[N][N];
int dx[8] = {-1, -1, -1, 1, 1, 1, 0, 0}; // 8 个方向
int dy[8] = {-1, 1, 0, 1, -1, 0, 1, -1};
int n, m;

void dfs(int x, int y) {
    for (int i = 0; i < 8; ++i) {
        int nx = x + dx[i], ny = y + dy[i];
        if (nx < 1 || nx > n || ny < 1 || ny > m) continue;
        if (visited[nx][ny] || mp[nx][ny] != '@') continue;
        visited[nx][ny] = true;
        dfs(nx, ny);
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    while (cin >> n >> m) {
        if (n == 0 && m == 0) break;

        // 初始化地图和访问数组
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                cin >> mp[i][j];
            }
        }

        memset(visited, false, sizeof(visited));
        int count = 0;

        for (int i = 1; i <= n; ++i) {
            fo...