#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue> 
using namespace std;
char a[21][21];
int boo[21][21];
bool vis[22][22];
int dx[4]={0,1,-1,0},
    dy[4]={1,0,0,-1};
int h,w,ans,x,y; 
bool ok(int x,int y)
{
    if(x>=1&&x<=h&&y>=1&&y<=w)return 1;
    return 0;
}
void bfs(int x,int y)
{
    queue <int> qx;
    queue <int> qy;
    qx.push(x);qy.push(y);
    while(!qx.empty())
    {
        int nowx=qx.front();qx.pop();
        int nowy=qy.front();qy.pop();
        ans++;vis[nowx][nowy]=1;
        for(int i=0;i<4;i++)
        {
            int xx=nowx+dx[i],yy=nowy+dy[i];
            if(boo[xx][yy]&&!vis[xx][yy]&&ok(xx,yy))
            {
                qx.push(xx);qy.push(yy);  
                vis[xx][yy]=1;
            }
        }
    }  
}
int main()
{
    while(scanf("%d%d",&w,&h)&&w&&h)
    {
        ans=0;
        memset(boo,0,sizeof(boo));
        memset(vis,0,sizeof(vis));
        for(int i=0;i<h;i++)
        {
            scanf("%s",a[i]);
            for(int j=0;j<w;j++)
            {
                if(a[i][j]==‘.‘)
                boo[i+1][j+1]=1;
                if(a[i][j]==‘@‘)
                {
                    boo[i+1][j+1]=1;
                    x=i+1;y=j+1;
                }
            }
        }
        bfs(x,y);
        printf("%d\n",ans);
    }
    return 0;
}