#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline string toString(T a) {
  ostringstream os("");
  os << a;
  return os.str();
}
template <typename T>
inline long long toLong(T a) {
  long long res;
  istringstream os(a);
  os >> res;
  return res;
}
template <typename T>
inline T SQ(T a) {
  return a * a;
}
template <typename T>
inline T GCD(T a, T b) {
  if (b == 0)
    return a;
  else
    return GCD(b, a % b);
}
template <typename T>
inline unsigned long long BIGMOD(T a, T b, T m) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return SQ(BIGMOD(a, b / 2, m)) % m;
  else
    return (a % m * BIGMOD(a, b - 1, m)) % m;
}
template <typename T>
inline vector<string> PARSE(T str) {
  vector<string> res;
  string s;
  istringstream os(str);
  while (os >> s) res.push_back(s);
  return res;
}
template <typename T>
inline unsigned long long DIST(T A, T B) {
  unsigned long long res =
      (A.x - B.x) * (A.x - B.x) + (A.y - B.y) * (A.y - B.y);
  return res;
}
template <typename T>
inline double cosAngle(T a, T b, T c) {
  double res = a * a + b * b - c * c;
  res = res / (2 * a * b);
  res = acos(res);
  return res;
}
template <typename T>
inline T POWER(T base, int po) {
  T res = 1;
  if (base == 0) return 0;
  for (int i = (0); i < (po); i++) res *= base;
  return res;
}
template <typename T>
inline bool IS_ON(T mask, T pos) {
  return mask & (1 << pos);
}
template <typename T>
inline int OFF(T mask, T pos) {
  return mask ^ (1 << pos);
}
template <typename T>
inline int ON(T mask, T pos) {
  return mask | (1 << pos);
}
template <typename T>
inline bool INSIDE_GRID(int R, int C, int ro, int clm) {
  if (R >= 0 && C >= 0 && R < ro && C < clm) return 1;
  return 0;
}
int arr[100005];
char g[15][15];
int ag[15][15];
int main() {
  int r, c;
  cin >> r >> c;
  for (int i = (0); i < (r); i++) cin >> g[i];
  memset(ag, 0, sizeof ag);
  for (int i = 0; i < r; i++) {
    bool state = 0;
    for (int j = (0); j < (c); j++)
      if (g[i][j] == 'S') {
        state = 1;
        break;
      }
    if (state) {
      continue;
    }
    for (int j = (0); j < (c); j++) ag[i][j]++;
  }
  for (int i = 0; i < c; i++) {
    bool state = 0;
    for (int j = (0); j < (r); j++)
      if (g[j][i] == 'S') {
        state = 1;
        break;
      }
    if (state) {
      continue;
    }
    for (int j = (0); j < (r); j++) ag[j][i]++;
  }
  int cnt = 0;
  for (int i = (0); i < (r); i++)
    for (int j = (0); j < (c); j++)
      if (ag[i][j] == 0) cnt++;
  cout << r * c - cnt << endl;
  return 0;
}
