hdu1312

/**/
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <stack>
#include <queue>

typedef long long LL;
using namespace std;

int n, m;
char s[25][25];

int sx, sy, ans;
int dist[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};

void dfs(int x, int y){
	if(s[x][y] == '.') ans++;
	s[x][y] = '#';
	for (int i = 0; i < 4; i++){
		int xx = x + dist[i][0], yy = y + dist[i][1];
		if(xx < 1 || xx > n || yy < 1 || yy > m || s[xx][yy] == '#') continue;
		dfs(xx, yy);
	}
}

int main()
{
	//freopen("in.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);

	while(scanf("%d %d", &n, &m) == 2){
		if(!n && !m) break;
		ans = 1;
		swap(n, m);
		for (int i = 1; i <= n; i++){
			scanf("%s", s[i] + 1);
			for (int j = 1; j <= m; j++){
				if(s[i][j] == '@'){
					sx = i, sy = j;
					break;
				}
			}
		}
		dfs(sx, sy);
		printf("%d\n", ans);
	}

	return 0;
}
/**/