#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <unordered_set>
#include <unordered_map>

using namespace std;

typedef long long int ll;
typedef pair<int, int> Pii;

const ll mod = 998244353;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int h, w;
  cin >> h >> w;
  vector<vector<char>> board(h, vector<char>(w));
  for (auto &x: board) {
    for (auto &y: x) cin >> y;
  }

  vector<vector<vector<ll>>> dp(h, vector<vector<ll>>(w, vector<ll>(h + w + 1)));
  dp[0][0][1] = 1;
  for (int i = 0; i < h; i++) {
    for (int j = 0; j < w; j++) {
      for (int k = 0; k < h + w; k++) {
        if (i < h - 1) {
          dp[i+1][j][k+1] = board[i+1][j] == 'o' ? (dp[i+1][j][k+1] + dp[i][j][k]) : dp[i+1][j][k+1];
          if (k > 0) dp[i+1][j][k-1] =  board[i+1][j] == 'x' ? (dp[i+1][j][k-1] + dp[i][j][k]) : dp[i+1][j][k-1];
        }
        if (j < w - 1) {
          dp[i][j+1][k+1] = board[i][j+1] == 'o' ? (dp[i][j+1][k+1] + dp[i][j][k]) : dp[i][j+1][k+1];
          if (k > 0) dp[i][j+1][k-1] = board[i][j+1] == 'x' ? (dp[i][j+1][k-1] + dp[i][j][k]) : dp[i][j+1][k-1];
        }
      }
    }
  }

  ll ans = 0;
  for (int i = 0; i <= h + w; i++) ans += dp[h-1][w-1][i];

  cout << ans << endl;

  return 0;
}