#include<bits/stdc++.h>
using namespace std;
using ll = long long;


const ll mod = 998'244'353;
//const ll mod = 1'000'000'007;
//const ll mod = 67'280'421'310'721;
struct mint{
    long long x;
    mint(long long 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{
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const{
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const{
        mint res(*this);
        return res*=a;
    }
    mint pow(long long n) const {
        assert(0 <= n);
        mint a = *this, r = 1;
        while (n) {
            if (n & 1) r *= a;
            a *= a;
            n >>= 1;
        }
        return r;
    }
    mint inv() const{
        return pow(mod-2);
    }
    mint& operator/=(const mint& a){
        return (*this)*=a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    bool operator==(const mint& a) const {
        return x == a.x;
    }
    bool operator<(const mint& a) const{
        return x < a.x;
    }
};


int main(){
    int h,w,k;
    cin>>h>>w>>k;
    vector<vector<vector<mint>>> dp(h,vector<vector<mint>>(w,vector<mint>(k,0)));
    dp[0][0][0] = 1;
    vector<string> s(h);
    for(int i = 0;i<h;i++) cin>>s[i];
    for(int i = 0;i<h;i++){
        for(int j = 0;j<w;j++){
            int dx[] = {1,0};
            int dy[] = {0,1};
            for(int l = 0;l<k;l++){
                for(int p = 0;p<2;p++){
                    int ni = i + dx[p];
                    int nj = j + dy[p];
                    if(ni>=h||nj>=w) continue;
                    if(s[ni][nj]=='#') continue;
                    if(s[ni][nj]=='.') dp[ni][nj][l] += dp[i][j][l];
                    else if(l+1<k) dp[ni][nj][l+1] += dp[i][j][l];
                }
            }
        }

    }
    mint ans = 0;
    for(int i = 0;i<k;i++) ans += dp[h-1][w-1][i];
    cout<<ans<<endl;
}