#include<cstdlib>

 #include<iostream>

 #include<cstdio>

 #include<string>

 #include<cmath>

 #include<queue>

 #include<cstring>

 #include<fstream>

 using namespace std;

 int n,m;

 int sum=;

 class node

 {

        public:

        int x;

        int y;

 }cur,next;

 queue<node> q;

 int map[][];

 int d[][]={,,-,,,,,-};

 void init()

 {

         memset(map,,sizeof(map));

 }

 void bfs()

 {

         while(!q.empty())

         {

                 cur=q.front();

                 q.pop();

                 for(int i=;i<;i++)

                 {

                         int x=cur.x+d[i][];

                         int y=cur.y+d[i][];

                         if(x>n||x<||y>m||y<||map[x][y]==) continue;

                         next.x=x;

                         next.y=y;

                         map[x][y]=;

                         sum++;

                         q.push(next);

                 }

         }

 }

 int main()

 {

         while(scanf("%d%d",&m,&n)!=EOF)

         {

                 sum=;

                 getchar();

                 if(n==&&m==) break;

                 for(int i=;i<=n;i++)

                 {

                         for(int j=;j<=m;j++)

                         {

                                 char c;

                                c=getchar();

                                if(c=='.') map[i][j]=;

                                if(c=='#') map[i][j]=;

                                if(c=='@')

                                {

                                         cur.x=i;

                                         cur.y=j;

                                         map[i][j]=;

                                }

                         }

                         getchar();

                 }

                 sum++;

                 q.push(cur);

                 bfs();

                 cout<<sum<<endl;

          }

          return ;

 }