#if !__INCLUDE_LEVEL__ #include __FILE__ // using mint = modint998244353; // using mint = modint1000000007; void solve(){ int H,W; cin>>H>>W; vector A(H); rep(i,0,H)cin>>A[i]; vector dp(H,vector(W,vector(1009,0))); dp[0][0][1]=1; rep(i,0,H)rep(j,0,W)rep(k,0,19){ if(A[i][j]=='o'){ if(i!=0)dp[i][j][k+1]+=dp[i-1][j][k]; if(j!=0)dp[i][j][k+1]+=dp[i][j-1][k]; } if(A[i][j]=='x'&&k!=0){ if(i!=0)dp[i][j][k-1]+=dp[i-1][j][k]; if(j!=0)dp[i][j][k-1]+=dp[i][j-1][k]; } } int sum=0; rep(i,0,1009)sum+=dp[H-1][W-1][i]; // debug(dp); cout< #include using namespace std; using namespace atcoder; #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define rep(i,l,r) for(int i=(l);i<(r);++i) #define rrep(i,l,r) for(int i=(r)-1;i>=(l);--i) using ll = long long; using ull = unsigned long long; using pii = pair; using pll = pair; #define pb push_back #define fi first #define se second #define sz(x) ((int)x.size()) #define pqueue priority_queue #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define inr(l, x, r) (l <= x && x < r) int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; #define INF (1<<30)-1 #define INFLL (1LL<<60)-1 #define popcount __builtin_popcount #define UNIQUE(v) sort(v.begin(),v.end()),v.erase(unique(v.begin(),v.end()),v.end()); void yn(bool flag){if(flag)cout<<"Yes"<<'\n'; else cout<<"No"<<'\n';} template bool chmax(T &a,const T& b){if(a bool chmin(T &a,const T& b){if(a>b){a=b;return true;}return false;} void solve(); #ifdef LOCAL # include # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast(0)) #endif int main(){ cin.tie(0); ios::sync_with_stdio(0); cout<