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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int h, w; cin >> h >> w;
	int k; cin >> k;
	vector<vector<char>> s(h, vector<char>(w));
	rep(i,0,h) rep(j,0,w) cin >> s[i][j];
	vector dp(h, vector(w, vector<mint>(k)));
	dp[0][0][0] = 1;
	rep(i,0,h){
		rep(j,0,w){
			if (s[i][j] == '#') continue;
			if (i-1 >= 0){
				rep(l,0,k){
					if (s[i][j] == 'o'){
						if (l-1 >= 0){
							dp[i][j][l] += dp[i-1][j][l-1];
						}
					}else{
						dp[i][j][l] += dp[i-1][j][l];
					}
				}
			}
			if (j-1 >= 0){
				rep(l,0,k){
					if (s[i][j] == 'o'){
						if (l-1 >= 0){
							dp[i][j][l] += dp[i][j-1][l-1];
						}
					}else{
						dp[i][j][l] += dp[i][j-1][l];
					}
				}
			}
		}
	}

	mint ans = 0;
	rep(i,0,k){
		ans += dp[h-1][w-1][i];
	}
	cout << ans.val() << '\n';
	
}