#include<iostream>
#include<cstring>
using namespace std;
char map[111][111];
int fword[8][2]={{1,0},{0,1},{-1,0},{0,-1},{1,1},{-1,-1},{-1,1},{1,-1}};
struct point
{
int x;
int y;
};
void bfs(const point &p)
{
point Queue[100];
int rear=0;
int front=0;
Queue[rear++]=p;
while(front!=rear)
{
point pt=Queue[--rear];
int i=pt.x;
int j=pt.y;
map[i][j]='*';
for(int k=0;k<8;k++)
{
int m=fword[k][0]+i;
int n=fword[k][1]+j;
pt.x=m;
pt.y=n;
if(map[m][n]=='@')
Queue[rear++]=pt;
}
}
}
int main()
{
int i,j;
point pt;
memset(map,0,sizeof(map));
int m,n;
while(cin>>m>>n&&n)
{
int count=0;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
char ch;
cin>>ch;
map[i][j]=ch;
}
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
if(map[i][j]=='@')
{
pt.x=i;
pt.y=j;
bfs(pt);
count++;
}
}
cout<<count<<endl;
}
return 0;
}