#include<bits/stdc++.h>
using std::cin;
using std::cout;
using namespace std::ranges;
using u64 = unsigned long long;
const int N = 105;
const int mod = 998244353;
using ll = long long;
// std::map<std::vector<int>, int> dp[N][N * N];
int n, m;

int v[N][N];
int res[N][N];
int ans;

void dfs(int k) {
	int a = -1, b = -1;
	for(int i = 1;i <= n;++i) {
		for(int j = 1;j <= m;++j) {
			if(!v[i][j]) {
				a = i;
				b = j;
				break;
			}
		}
		if(a > 0) break;
	}
	if(a == -1) {
		ans += k == 0;
		return ;
	}
	if(k == 0) return ;
	for(int i = a;i <= n;++i) {
		for(int j = b;j <= m;++j) {
			int ok = 1;
			for(int k = a;k <= i;++k)
				for(int l = b;l <= j;++l) {
					ok = ok && !v[k][l];
				}
			if(!ok) break;
			for(int k = a;k <= i;++k)
				for(int l = b;l <= j;++l) {
					v[k][l] = 1;
				}
			dfs(k - 1);
			for(int k = a;k <= i;++k)
				for(int l = b;l <= j;++l) {
					v[k][l] = 0;
				}
		}
	}
}
int W, H, k;

int pow(int a, int b, int ans = 1) {
	for(;b;b >>= 1, a = (u64) a * a % mod) if(b & 1)
		ans = (u64) ans * a % mod;
	return ans;
}
const int deg = 6;
int get(std::vector<int> v, int p) {
	u64 sum = 0;
	for(int i = 0;i < deg;++i) {
		u64 a = 1, b = 1;
		for(int j = 0;j < deg;++j) if(j != i) {
			a = (u64) a * (p - j + mod) % mod;
			b = (u64) b * (i - j + mod) % mod;
		}
		sum = (sum + (u64) a * v[i] % mod * pow(b, mod - 2)) % mod;
	}
	return sum;
}

int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> W >> H >> k;
	for(n = 1;n <= deg;++n) {
		for(m = 1;m <= deg;++m) {
			ans = 0;
			dfs(k);
			res[n][m] = ans;
		}
	}
	-- W, -- H;
	std::vector<int> v(deg);
	for(int i = 0;i < deg;++i) {
		std::vector<int> tmp(res[i + 1] + 1, res[i + 1] + deg + 1);
		v[i] = get(tmp, H);
	}
	cout << get(v, W) << '\n';
	return 0;
}