#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

mint dp[102][102][202];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int h, w, k;
  cin >> h >> w >> k;
  string s;
  dp[0][0][0] = 1;
  rep(i, h) {
    cin >> s;
    rep(j, w) {
      if (s[j] == '#') continue;
      if (s[j] == 'o') {
        rrep(k, i + j) dp[i][j][k + 1] = dp[i][j][k];
        dp[i][j][0] = 0;
      }
      rrep(k, i + j + 1) if (mint v = dp[i][j][k]; v.val()) {
        dp[i+1][j][k] += v;
        dp[i][j+1][k] += v;
      }
    }
  }
  mint ans = accumulate(dp[h-1][w-1], dp[h-1][w-1] + k, mint());
  cout << ans.val() << '\n';
}