#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

const ll MOD = 998244353;

ll dp[101][101][201];

int main() {
  int H, W, K;
  cin >> H >> W >> K;
  vector<string> S(H);

  for (int i = 0; i < H; ++i) {
    cin >> S[i];
  }

  dp[0][0][K] = 1;
  for (int y = 0; y < H; ++y) {
    for (int x = 0; x < W; ++x) {
      for (int k = 1; k <= K; ++k) {
        if (y + 1 < H && S[y + 1][x] != '#') {
          if (S[y + 1][x] == 'o') {
            dp[y + 1][x][k - 1] += dp[y][x][k];
            dp[y + 1][x][k - 1] %= MOD;
          } else {
            dp[y + 1][x][k] += dp[y][x][k];
            dp[y + 1][x][k] %= MOD;
          }
        }
        if (x + 1 < W && S[y][x + 1] != '#') {
          if (S[y][x + 1] == 'o') {
            dp[y][x + 1][k - 1] += dp[y][x][k];
            dp[y][x + 1][k - 1] %= MOD;
          } else {
            dp[y][x + 1][k] += dp[y][x][k];
            dp[y][x + 1][k] %= MOD;
          }
        }
      }
    }
  }

  ll ans = 0;

  for (int k = 1; k <= K; ++k) {
    ans += dp[H - 1][W - 1][k];
    ans %= MOD;
  }

  cout << ans << endl;

  return 0;
}