#include // #include // #include using namespace std; // using namespace atcoder; // using bint = boost::multiprecision::cpp_int; using ll = long long; using ull = unsigned long long; using P = pair; using vi = vector; using vvi = vector; using vvvi = vector; #define rep(i,n) for(ll i = 0;i < (ll)n;i++) #define ALL(x) (x).begin(),(x).end() #define sz(c) ((ll)(c).size()) #define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin()) // #define MOD 1000000007 #define MOD 998244353 templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,vector&v){for(int i = 0;i < v.size();i++)os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.first>>p.second;return is;} int main(){ ios_base::sync_with_stdio(0), cin.tie(0); int h,w; cin >> h >> w; vector s(h); cin >> s; vvvi dp(h,vvi(w,vi(h+w+1))); dp[0][0][1] = 1; rep(i,h)rep(j,w)rep(k,h+w+1){ if(s[i][j] == '#' || !dp[i][j][k])continue; if(i != h-1 && s[i+1][j] != '#'){ int nk = k + (s[i+1][j] == 'o' ? 1 : -1); if(nk >= 0)dp[i+1][j][nk] += dp[i][j][k]; } if(j != w-1 && s[i][j+1] != '#'){ int nk = k + (s[i][j+1] == 'o' ? 1 : -1); if(nk >= 0)dp[i][j+1][nk] += dp[i][j][k]; } } ll res = 0; rep(i,h+w+1)res += dp[h-1][w-1][i]; cout << res << "\n"; return 0; }