1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <stack>
 5 #include <queue>
 6 #include <conio.h>
 7 
 8 using namespace std;
 9 
10 typedef struct info{
11     int i,j;
12 }location;
13 
14 int m,n;
15 int countt;
16 char t;
17 char oilmap[105][105];
18 stack<location> s;
19 
20 int calx[8]={-1,-1,-1,0,0,1,1,1};
21 int caly[8]={-1,0,1,-1,1,-1,0,1};
22 
23 void exploit(int i,int j){
24     location temp={i,j};
25     location now,next;
26     s.push(temp);
27     while(!s.empty()){
28         now=s.top();
29         s.pop();
30         oilmap[now.i][now.j]='*';
31         for(int k=0;k<8;k++){
32             next.i=now.i+calx[k];
33             next.j=now.j+caly[k];
34             if(next.i>=0 && next.i<m && next.j>=0 && next.j<n){
35                 if(oilmap[next.i][next.j]=='@'){
36                     s.push(next);
37                 }
38             }
39         }
40     }
41 
42 }
43 
44 int main()
45 {
46     while(~scanf("%d %d",&m,&n)){
47         getchar();
48         if(m==0) {break;}
49         for(int i=0;i<m;i++){
50             for(int j=0;j<n;j++){
51                 cin>>oilmap[i][j];
52             }
53         }
54         countt=0;
55         for(int i=0;i<m;i++){
56             for(int j=0;j<n;j++){
57                 if(oilmap[i][j]=='@'){
58                     exploit(i,j);
59                     countt++;
60                 }
61             }
62         }
63         printf("%d\n",countt);
64     }
65     return 0;
66 }