#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()    // sortなどの引数を省略
#define max3(x, y, z) max(x, max(y, z))  // 3変数max
#define min3(x, y, z) min(x, min(y, z))  // 3変数min
#define chmin(m, v) m = min((m), (v))    //最小値を更新
#define chmax(m, v) m = max((m), (v))    //最大値を更新
#define rep(i, n) repi(i, 0, n)          // 0-N rep
#define reps(i, n) repi(i, 1, n + 1)     // 1-N
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); i++)  // a-b


const int mod = 998244353;
struct mint {
  ll x;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
signed main(){
    ll H,W,K;
    cin >> H >> W >> K;
    vector<string> v(H);
    rep(i,H){
        cin >> v[i];
    }
    vector<vector<vector<mint>>> dp(H,vector<vector<mint>>(W,vector<mint>(K)));
    dp[0][0][0]=1;
    rep(i,H){
        rep(j,W){
            rep(k,K){
                if(v[i][j]=='.'){
                    if(i!=0)dp[i][j][k]+=dp[i-1][j][k];
                    if(j!=0)dp[i][j][k]+=dp[i][j-1][k];
                }
                if(v[i][j]=='o'){
                    if(i!=0 and k!=0)dp[i][j][k]+=dp[i-1][j][k-1];
                    if(j!=0 and k!=0)dp[i][j][k]+=dp[i][j-1][k-1];
                }
            }
        }
    }
    mint ans = 0;
    rep(i,K){
        ans+=dp[H-1][W-1][i];
    }
    cout << ans << endl;
}