h, w, k = map(int, input().split())
S = [list(input()) for _ in range(h)]
mod = 998244353

Directions = [(1, 0), (0, 1)]
DP = [[[0 for _ in range(k)] for _ in range(w)] for _ in range(h)]
DP[0][0][0] = 1
for i in range(h):
    for j in range(w):
        for kk in range(k):
            if DP[i][j][kk] > 0:
                for di, dj in Directions:
                    ni, nj = i + di, j + dj
                    if 0 <= ni < h and 0 <= nj < w:
                        if S[ni][nj] == '#':
                            continue
                        elif S[ni][nj] == 'o':
                            if kk + 1 < k:
                                DP[ni][nj][kk + 1] += DP[i][j][kk]
                                DP[ni][nj][kk + 1] %= mod
                        else:
                            DP[ni][nj][kk] += DP[i][j][kk]
                            DP[ni][nj][kk] %= mod
ans = 0
for i in range(k):
    ans += DP[-1][-1][i]
    ans %= mod
print(ans)