#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60;
const int IINF = (1 << 30) - 1;

template<typename T> struct Edge{
    int to; T w;
    Edge(int to_, T w_=1){
        to = to_;
        w=w_;
    }
};
template<typename T> using Tree = vector<vector<Edge<T>>>;
template<typename T> using Graph = vector<vector<Edge<T>>>;
/* 容量&重み付きエッジ for Dinic */
template<typename T> struct REdge{
    int to;
    T cap;
    T cost;
    int rev;
    REdge(int to_, T cap_, T cost_=1){
        to = to_;
        cap = cap_;
        cost = cost_;
    }
    
    REdge(int to_, T cap_, T cost_, int rev_){
        to = to_;
        cap = cap_;
        cost = cost_;
        rev = rev_;
    }
};

/* 残余グラフ for Dinic */
template<typename T> using RGraph = vector<vector<REdge<T>>>;

template<long long mod>
class modint{
    long long x;
public:
    modint(long long x=0) : x((x%mod+mod)%mod) {}
    modint operator-() const { 
      return modint(-x);
    }
    bool operator==(const modint& a){
        if(x == a) return true;
        else return false;
    }
    bool operator==(long long a){
        if(x == a) return true;
        else return false;
    }
    bool operator!=(const modint& a){
        if(x != a) return true;
        else return false;
    }
    bool operator!=(long long a){
        if(x != a) return true;
        else return false;
    }
    modint& operator+=(const modint& a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    modint& operator-=(const modint& a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
    }
    modint& operator*=(const  modint& a) {
        (x *= a.x) %= mod;
        return *this;
    }
    modint operator+(const modint& a) const {
        modint res(*this);
        return res+=a;
    }
    modint operator-(const modint& a) const {
        modint res(*this);
        return res-=a;
    }
    modint operator*(const modint& a) const {
        modint res(*this);
        return res*=a;
    }
    modint pow(long long t) const {
        if (!t) return 1;
        modint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    // for prime mod
    modint inv() const {
        return pow(mod-2);
    }
    modint& operator/=(const modint& a) {
        return (*this) *= a.inv();
    }
    modint operator/(const modint& a) const {
        modint res(*this);
        return res/=a;
    }

    friend std::istream& operator>>(std::istream& is, modint& m) noexcept {
        is >> m.x;
        m.x %= mod;
        if (m.x < 0) m.x += mod;
        return is;
    }

    friend ostream& operator<<(ostream& os, const modint& m){
        os << m.x;
        return os;
    }
};

using mint = modint<MOD998244353>;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll H, W, K; cin >> H >> W >> K;
    vector<string> S(H); rep(i, H) cin >> S[i];

    vector<vector<vector<mint>>> dp(H, vector<vector<mint>>(W, vector<mint>(K+1, 0)));

    dp[0][0][K] = 1;
    //初期化
    for(ll i=1; i<H; i++){
        for(ll k=0; k<=K; k++){
            if(S[i][0]=='.'){
                dp[i][0][k] = dp[i-1][0][k];
            }else if(S[i][0]=='o' && k < K){
                dp[i][0][k] = dp[i-1][0][k+1];
            }
        }
    }
    for(ll j=1; j<W; j++){
        for(ll k=0; k<=K; k++){
            if(S[0][j]=='.'){
                dp[0][j][k] += dp[0][j-1][k];
            }else if(S[0][j]=='o' && k < K){
                dp[0][j][k] += dp[0][j-1][k+1];
            }
        }
    }

    for(ll i=1; i<H; i++) for(ll j=1; j<W; j++){
        for(ll k=0; k<=K; k++){
            //上から
            if(S[i][j]=='.'){
                dp[i][j][k] += dp[i-1][j][k];
            }else if(S[i][j]=='o' && k < K){
                dp[i][j][k] += dp[i-1][j][k+1];
            }

            //左から
            if(S[i][j]=='.'){
                dp[i][j][k] += dp[i][j-1][k];
            }else if(S[i][j]=='o' && k < K){
                dp[i][j][k] += dp[i][j-1][k+1];
            }
        }
    }

    mint ans = 0;
    for(ll k=1; k<=K; k++) ans += dp[H-1][W-1][k];
    cout << ans << endl;
}