/**
 *  Red and Black (PKU 1979)
 *  by Kenji Inoue, 2007-02-03
 **/

#include <iostream>

using namespace std;

int w, h;
string f[20];

int dx[] = {-1,  1,  0 , 0};
int dy[] = { 0,  0, -1,  1};

int main() {
  while (cin >> w >> h, (w||h)) {
    for (int i=0; i<h; i++) {
      cin >> f[i];
    }

    int cnt = 1;
    bool changed = true;
    while (changed) {
      changed = false;

      for (int y=0; y<h; y++) {
        for (int x=0; x<w; x++) {
          if (f[y][x] == '#' || f[y][x] == '@') { continue; }
          for (int i=0; i<4; i++) {
            int mx = x + dx[i];
            int my = y + dy[i];

            if (mx < 0 || w <= mx) { continue; }
            if (my < 0 || h <= my) { continue; }
            if (f[my][mx] != '@') { continue; }

            f[y][x] = '@';
            cnt++;
            changed = true;
            break;
          }
        }
      }
    }

    cout << cnt << endl;
  }

  return 0;
}