#include<iostream>

#include<stdio.h>

#include<stdlib.h>

#include<time.h>

#include <queue>

using namespace std;

int N=;

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

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

//bfs队列加对象，对象就是队列的类型，在这个题中就可以直接用x,y

//满足条件（为#）的对象插入队列

struct Point{

    int x;

    int y;

};

queue<Point> q;

//标记是否到达

int mark[][]={};

char data[][];

void bfs(int i,int j,int a,int b){

    mark[i][j]=;

    q.push({i,j});

    N++;

    while(!q.empty()){

        Point first=q.front();

        q.pop();

        for (int k = ; k < ; ++k) {

            int x=first.x+ax[k];

            int y=first.y+ay[k];

            if(x>= && x<a && y>= && y<b && data[x][y]=='@' && mark[x][y]==){

                mark[x][y]=;

                q.push({x,y});

            }

        }

    }

}

int main(){

    int a,b;

    while(cin>>a>>b) {

        if(a== && b==){

            break;

        }

        N=;

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

            for (int j = ; j < b; ++j) {

                cin >> data[i][j];

            }

        }

        for (int k = ; k < a; ++k) {

            for (int l = ; l < b; ++l) {

                //cout<<data[k][l]<<endl;

                if (data[k][l] == '@' && mark[k][l]==) {

                    bfs(k, l, a, b);

                }

            }

        }

        cout << N<<endl;

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

            for (int j = ; j < b; ++j) {

               data[i][j]=;

            }

        }

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

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

                data[m][i]='';

                mark[m][i]=;

            }

        }

    }

}