# 3次元dpにするか
# dp[座標i][座標j][累積ダメージk]に至るパターン数
# 100*100*200なので間に合うのでは
# 答えはsum(dp[H-1][W-1][:K+1])

H, W, K = map(int, input().split())
S = []
for i in range(H):
    s = input()
    S.append(s)

#print(S)

dp = [[[0]*(K) for j in range(W)] for i in range(H)]
dp[0][0][0] = 1
mod = 998244353

for i in range(H):
    for j in range(W):
        for k in range(K):
            if i == 0 and j == 0:
                continue
            elif i == 0:
                if S[i][j] == '#':
                    continue
                elif S[i][j] == 'o':
                    if k-1 >= 0:
                        #dp[i][j][k] += dp[i-1][j][k-1]
                        dp[i][j][k] += dp[i][j-1][k-1]
                elif S[i][j] == '.':
                    #dp[i][j][k] += dp[i-1][j][k]
                    dp[i][j][k] += dp[i][j-1][k]  
            elif j == 0:
                if S[i][j] == '#':
                    continue
                elif S[i][j] == 'o':
                    if k-1 >= 0:
                        dp[i][j][k] += dp[i-1][j][k-1]
                        #dp[i][j][k] += dp[i][j-1][k-1]
                elif S[i][j] == '.':
                    dp[i][j][k] += dp[i-1][j][k]
                    #dp[i][j][k] += dp[i][j-1][k] 
            else:
                if S[i][j] == '#':
                    continue
                elif S[i][j] == 'o':
                    if k-1 >= 0:
                        dp[i][j][k] += dp[i-1][j][k-1]
                        dp[i][j][k] += dp[i][j-1][k-1]
                elif S[i][j] == '.':
                    dp[i][j][k] += dp[i-1][j][k]
                    dp[i][j][k] += dp[i][j-1][k]  
            dp[i][j][k] %= mod
            
ans = sum(dp[H-1][W-1])
ans %= mod
print(ans)