#include<iostream>
using namespace std;

void DFS(int row, int col, int m, int n, int (*v)[100], char (*c)[101]){
	v[row][col] = 1;
	for (int k = row - 1; k <= row + 1; k++){
		for (int h = col - 1; h <= col + 1; h++){
			if (k >= 0 && k < m && h >= 0 && h < n && v[k][h] == 0 && c[k][h] == '@')
				DFS(k, h, m, n, v, c);
			}
		}

}

int main() {
	int m, n, ans;
	while (cin >> m >> n && m != 0){
		char c[100][101] = {};
		int v[100][100] = {};
		ans = 0;
		for (int i = 0; i < m; i++)
			for (int j = 0; j < n; j++)
				cin >> c[i][j];
		for (int i = 0; i < m; i++){
			for (int j = 0; j < n; j++){
				if (c[i][j] == '@' && v[i][j] == 0){
					ans++;
					DFS(i, j, m, n, v, c);
				}
			}
		}
		cout << ans << endl;
	}
	return 0;
}