#include using namespace std; #include using namespace atcoder; using ll = long long; using VI = vector; using VVI = vector; using VL = vector; using VVL = vector; using VD = vector; using VVD = vector; using VS = vector; using P = pair; using VP = vector

; #define rep(i, n) for (ll i = 0; i < ll(n); i++) #define out(x) cout << x << endl #define dout(x) cout << fixed << setprecision(10) << x << endl #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(),(a).rend() #define sz(x) (int)(x.size()) #define re0 return 0 #define pcnt __builtin_popcountll template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } constexpr int inf = 1e9; constexpr ll INF = 1e18; //using mint = modint1000000007; using mint = modint998244353; int di[4] = {1,0,-1,0}; int dj[4] = {0,1,0,-1}; mint dp[101][101][101]; int main(){ int h,w,K; cin >> h >> w >> K; VS s(h); rep(i,h) cin >> s[i]; rep(i,h)rep(j,w)rep(k,K) dp[i][j][k] = 0; dp[0][0][0] = 1; rep(i,h)rep(j,w)rep(k,K){ rep(v,2){ int ni = i+di[v]; int nj = j+dj[v]; if(ni < 0 || nj < 0 || ni >= h || nj >= w) continue; if(s[ni][nj] == '#') continue; if(s[ni][nj] == 'o' && k+1 < K){ dp[ni][nj][k+1] += dp[i][j][k]; } if(s[ni][nj] == '.'){ dp[ni][nj][k] += dp[i][j][k]; } } } mint ans = 0; rep(k,K) ans += dp[h-1][w-1][k]; out(ans.val()); }