#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 10;
string s[N];
int n, m, cnt;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
void bfs(int x, int y)
{
if (s[x][y] == '#') return ;
s[x][y] = '#';
cnt ++ ;
for (int i = 0; i < 4; i ++ )
{
int a = x + dx[i], b = y + dy[i];
if (a >= 0 && a < n && b >= 0 && b < m) bfs(a, b);
}
}
signed main()
{
cin >> n >> m;
for (int i = 0; i < n; i ++ ) cin >> s[i];
for (int i = 0; i < m; i ++ )
{
bfs(0, i);
bfs(n - 1, i);
}
for (int i = 0; i < n; i ++ )
{
bfs(i, 0);
bfs(i, m - 1);
}
cout << n * m - cnt << endl;
return 0;
}