#include #include #define rep(i, n) for (int i = 0; i < n; ++i) typedef long long ll; using namespace atcoder; using namespace std; using mint = modint998244353; int main() { cin.tie(0)->sync_with_stdio(0); int H, W, K; cin >> H >> W >> K; vector S(H); rep(i, H) cin >> S[i]; vector dist(H, vector(W, vector(K))); dist[0][0][0] = 1; rep(k, K) rep(i, H) rep(j, W) { if (i + 1 < H) { if (S[i + 1][j] == '.') dist[i + 1][j][k] += dist[i][j][k]; else if (S[i + 1][j] == 'o' && k + 1 < K) dist[i + 1][j][k + 1] += dist[i][j][k]; } if (j + 1 < W) { if (S[i][j + 1] == '.') dist[i][j + 1][k] += dist[i][j][k]; else if (S[i][j + 1] == 'o' && k + 1 < K) dist[i][j + 1][k + 1] += dist[i][j][k]; } } mint ans = 0; rep(k, K) ans += dist[H - 1][W - 1][k]; cout << ans.val() << "\n"; return 0; }