#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
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;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int h, w, k;
  cin >> h >> w >> k;
  k++;
  vector<string> S(h);
  rep(i, h) cin >> S[i];
  vector dp(h, vector<mint>(w)), d = dp;
  dp[0][0] = d[0][0] = 1;
  for (int s = 1; s <= h - 1 + w - 1; s++) {
    rep(z, 2) {
      int ps = s - k;
      int l = ps - min(w - 1, ps), r = l, r_last = min(h - 1, ps) + 1;
      mint v;
      for (int s1 = s - 1 - z, p = s1 - min(w - 1, s1), p_last = min(h - 1, s1), q = s1 - p; p <= p_last; p++, q--) {
        while (r < r_last && r <= p) v += dp[r][ps - r], r++;
        while (l < r && ps - l > q) v -= dp[l][ps - l], l++;
        d[p][q] -= v;
      }
    }
    for (int p = s - min(w - 1, s), p_last = min(h - 1, s), q = s - p; p <= p_last; p++, q--) {
      mint v;
      if (p) v += d[p-1][q];
      if (q) v += d[p][q-1];
      if (p && q) v -= d[p-1][q-1];
      d[p][q] = v;
      if (S[p][q] != '#') {
        dp[p][q] = v;
        d[p][q] += v;
      }
    }
  }
  cout << dp[h - 1][w - 1].val() << '\n';
}