# include <stdio.h>
# include <string.h>
# include <stdlib.h>
# include <iostream>
# include <fstream>
# include <vector>
# include <queue>
# include <stack>
# include <map>
# include <math.h>
# include <algorithm>
using namespace std;
# define pi acos(-1.0)
# define mem(a,b) memset(a,b,sizeof(a))
# define FOR(i,a,n) for(int i=a; i<=n; ++i)
# define For(i,n,a) for(int i=n; i>=a; --i)
# define FO(i,a,n) for(int i=a; i<n; ++i)
# define Fo(i,n,a) for(int i=n; i>a ;--i)
typedef long long LL;
typedef unsigned long long ULL;

const int MAXM=25;
char a[MAXM][MAXM];
int n,m,ans;
int cx[]={-1,1,0,0};
int cy[]={0,0,-1,1};

struct node
{
    int x,y;
};

queue<node>Q;

void bfs()
{
    while(!Q.empty())
    {
        int x=Q.front().x;
        int y=Q.front().y;
        Q.pop();
        for(int i=0;i<4;i++)
        {
            int tx=x+cx[i];
            int ty=y+cy[i];
            if(a[tx][ty]==‘.‘)
            {
                ans++;
                a[tx][ty]=‘#‘;
                Q.push(node{tx,ty});
            }
        }
    }
}

int main()
{
    //freopen("in.txt", "r", stdin);
    while(cin>>m>>n,n&&m)
    {
        mem(a,0);
        for(int i=1;i<=n;i++)
        {
            cin>>a[i]+1;
            for(int j=1;j<=m;j++)
            {
                if(a[i][j]==‘@‘)
                {
                    Q.push(node{i,j});
                    a[i][j]=‘#‘;
                }
            }
        }
        ans=1;
        bfs();
        cout<<ans<<endl;
    }
    return 0;
}