mod=998244353
H,W,K = map(int, input().split())
S=[]
for _ in range(H):
    S.append(list(input()))
DP=[[[0]*K for _ in range(W)] for _ in range(H)]
DP[0][0][0]=1
for i in range(H):
    for j in range(W):
        if S[i][j]=='.':
            for k in range(K):
                if i<H-1:
                    DP[i+1][j][k]=(DP[i+1][j][k]+DP[i][j][k])%mod
                if j<W-1:
                    DP[i][j+1][k]=(DP[i][j+1][k]+DP[i][j][k])%mod
        if S[i][j]=='o':
            for k in range(K-1):
                if i<H-1:
                    DP[i+1][j][k+1]=(DP[i+1][j][k+1]+DP[i][j][k])%mod
                if j<W-1:
                    DP[i][j+1][k+1]=(DP[i][j+1][k+1]+DP[i][j][k])%mod

print(sum(DP[H-1][W-1])%mod)