#include using namespace std; #define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++) #define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define el '\n' #define spa " " #define Yes cout << "Yes" << el #define No cout << "No" << el #define YES cout << "YES" << el #define NO cout << "NO" << el #define eps (1e-10) #define Equals(a,b) (fabs((a) - (b)) < eps ) #define debug(x) cerr << #x << " = " << x << el using ll = long long; using ull = unsigned long long; using pii = pair; using pll = pair; using vi = vector; using vl = vector; using vvl = vector>; using vs = vector; using vb = vector; const double pi = 3.141592653589793238; const int inf = 1073741823; const ll infl = 1LL << 60; const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string abc = "abcdefghijklmnopqrstuvwxyz"; const ll MOD = 998244353; #include using namespace atcoder; using mint = modint998244353; using vm = vector; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll h,w,k;cin>>h>>w>>k; vs S(h); rep(i,0,h)cin>>S[i]; auto ok=[&](ll a,ll b){ if(0<=a&&a> dp(h,vector(w,vm(h+w+1,0))); dp[0][0][0]=1; rep(i,0,h)rep(j,0,w){ rep(kk,0,2){ ll nx=i+X[kk],ny=j+Y[kk]; rep(l,0,h+w){ if(ok(nx,ny)&&S[nx][ny]!='#'){ if(S[nx][ny]=='.'){ dp[nx][ny][l]+=dp[i][j][l]; }else{ dp[nx][ny][l+1]+=dp[i][j][l]; } } } } } mint ans=0; rep(i,0,k){ ans+=dp[h-1][w-1][i]; } cout<