#include<iostream>
#include<vector>
using namespace std;
int main() {
  int H,W,K;
  cin >> H >> W >> K;
  char c;
  vector<vector<int>> m(H,vector<int>(W,0));
  for(int i=0;i<H;i++)for(int j=0;j<W;j++) {
    cin >> c;
    if(c == 'o')m[i][j] = 1;
    else if(c == '#')m[i][j] = K;
  }
  vector<vector<vector<int>>> dp(H,vector<vector<int>>(W,vector<int>(K+1,0)));
  dp[0][0][K] = 1;
  for(int i=0;i<H;i++)for(int j=0;j<W;j++)for(int k=0;k<=K;k++) {
    if(i < H-1 && k-m[i+1][j] > 0)dp[i+1][j][k-m[i+1][j]] = (dp[i+1][j][k-m[i+1][j]]+dp[i][j][k])%998244353;
    if(j < W-1 && k-m[i][j+1] > 0)dp[i][j+1][k-m[i][j+1]] = (dp[i][j+1][k-m[i][j+1]]+dp[i][j][k])%998244353;
  }
  long long ans = 0;
  for(int i=1;i<=K;i++)ans = (ans+dp[H-1][W-1][i])%998244353;
  cout << ans << endl;
}