#include <iostream>

#include <cstdio>

#include <queue>

#include <cstring>

using namespace std;

const int M = ;

char map[M][M];int m,n;

int res;

struct Oil

{

    int x,y;

};

queue <Oil> oil;

int dire[][] = {{-,},{,},{,},{,-},{,},{-,-},{,-},{-,}};    //方向

void bfs()

{

    while (!oil.empty())

    {

        Oil oo = oil.front();

        oil.pop();

        int dx = oo.x;

        int dy = oo.y;

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

        {

            int x = dx+dire[i][];

            int y = dy+dire[i][];

            if (x >=  && x < m && y < n && y >=  && map[x][y] == '@')

            {

                map[x][y] = '*';

                Oil o;

                o.x = x;

                o.y = y;

                oil.push(o);

            }

        }

    }

}

int main()

{

    while (cin >> m >> n && m)

    {

        res = ;

        memset(visited,,sizeof (visited));

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

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

                cin >> map[i][j];

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

        {

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

            {

                if (map[j][k] == '@')

                {

                    map[j][k] = '*';

                    Oil oo;

                    oo.x = j;

                    oo.y = k;

                    oil.push(oo);

                    res++;

                    bfs();

                }

            }

        }

        cout << res << endl;

    }

    return ;

}