#include using namespace std; #define rep(i, n) for (ll i = 0; i < (ll)(n); i++) #define rep2(i, s, n) for (ll i = s; i <= (ll)(n); i++) #define rep3(i, s, n, d) for (ll i = s; i <= (ll)(n); i += d) #define rep4(i, s, n, d) for (ll i = s; i >= (ll)(n); i += d) typedef long long ll; typedef long double ld; typedef unsigned long long ull; typedef vector vi; typedef vector vvi; typedef vector vvvi; typedef vector vvvvi; typedef vector vs; typedef vector vvs; typedef vector vvvs; typedef vector vc; typedef vector vvc; typedef vector vvvc; typedef vector vll; typedef vector vvll; typedef vector vvvll; typedef vector vvvvll; typedef vector vd; typedef vector vvd; typedef vector vvvd; typedef vector vld; typedef vector vvld; typedef vector vvvld; typedef vector vb; typedef vector vvb; typedef vector vvvb; typedef vector> vpi; typedef vector> vpll; typedef pair pi; typedef vector vpi; typedef vector vvpi; typedef pair pll; typedef vector vpll; typedef vector vvpll; typedef tuple tui3; typedef tuple tull3; typedef priority_queue, greater> pqi; typedef priority_queue, greater> pqvi; typedef priority_queue, greater> pqll; typedef priority_queue, greater> pqvll; typedef priority_queue, greater> pqpll; typedef priority_queue, less> rpqpll; typedef priority_queue, less> rpqi; typedef priority_queue, less> rpqvi; typedef priority_queue, greater> pqtui3; typedef priority_queue, less> rpqtui3; typedef priority_queue, greater> pqtull3; typedef priority_queue, less> rpqtull3; #define yes(ans) if(ans)cout << "yes"<< endl; else cout << "no" << endl #define Yes(ans) if(ans)cout << "Yes"<< endl; else cout << "No" << endl #define YES(ans) if(ans)cout << "YES"<< endl ;else cout << "NO" << endl #define printv(vec) {rep(i, vec.size()) cout << vec[i] << ' '; cout << endl;} #define printvv(vec) rep(i, vec.size()) {rep(j, vec[i].size()) cout << vec[i][j] << ' '; cout << endl;}; #define printvvv(vec) rep(i, vec.size()) { rep(j, vec[i].size()) { rep(k, vec[i][j].size()) cout << vec[i][j][k] << ' '; cout << " "; }cout << endl; }; #define all1(x) x.begin(),x.end() #define all2(x) x.rbegin(), x.rend() #define so(x) sort(all1(x)) #define re(x) reverse(all1(x)) #define rso(x) sort(all2(x)) #define vco(x, a) count(all1(x), a) #define per(x) next_permutation(all1(x)) #define iINF 2147483647 #define llINF 9223372036854775807 #define INF 1000000000000000000 #define mod 998244353 #define mod2 1000000007 int main() { // アルゴリズム一覧を見る // 嘘解法ですか ll h, w; cin >> h >> w; vvc vec(h, vc(w)); rep(i, h) rep(j, w) cin >> vec[i][j]; vvvll dp(h, vvll(w, vll(25))); dp[0][0][1] = 1; rep(i, h) rep(j, w){ if(vec[i][j]=='#') continue; if(i!=0){ rep(k, 25){ if(dp[i-1][j][k]==0) continue; if(vec[i][j]=='o') dp[i][j][k+1] +=dp[i-1][j][k]; if(vec[i][j]=='x'){ if(k>0) dp[i][j][k-1] += dp[i-1][j][k]; } } } if(j!=0){ rep(k, 25){ if(dp[i][j-1][k]==0) continue; if(vec[i][j]=='o') dp[i][j][k+1] +=dp[i][j-1][k]; if(vec[i][j]=='x'){ if(k>0) dp[i][j][k-1] += dp[i][j-1][k]; } } } } ll ans = 0; rep(i, 25) ans += dp[h-1][w-1][i]; cout << ans << endl; }