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

#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define orange(a...) orange_(#a, a)
#define debug(a...) debug_(#a, a)
template <typename i>
void orange_(const char * s, i l, i r) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; l != r; l++)
        cerr << (f++ ? " " : "") << *l;
    cerr << " ]\e[0m\n";
}
template <typename ...T>
void debug_(const char * s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

int a[10][10];
int cnt[10];

void dfs(const int n, const int m, int i, int j, int k) {
    while (i < n) {
        while (j < m && a[i][j])
            ++j;
        if (j == m) {
            j = 0;
            i++;
        } else {
            break;
        }
    }

    if (i == n) {
        cnt[k] += 1;
        // debug(n, m, i, j);
        // for (int t = 0; t < n; t++)
        //     orange(a[t], a[t]+m);

        return;
    }

    if (k >= 5) {
        return;
    }

    const auto clean = [&](int T, int S) {
        for (int t = 0; t < T; t++) {
            for (int s = 0; s < S; s++)
                a[i + t][j + s] = 0;
        }
    };

    for (int A = 1; i + A <= n; A++) {
        for (int B = 1; j + B <= m; B++) {
            bool ok = true;
            for (int t = 0; t < A; t++)
                if (a[i + t][j + B - 1])
                    ok = false;
            if (!ok) {
                clean(A, B - 1);
                break;
            }
            for (int t = 0; t < A; t++)
                a[i + t][j + B - 1] = k + 1;

            dfs(n, m, i, j+B, k + 1);

            if (j + B == m)
                clean(A, B);
        }
    }
}

const int mod = 998244353;

int modpow(int e, int p) {
    int r = 1;
    while (p) {
        if (p & 1) r = 1LL*r*e%mod;
        e = 1LL*e*e%mod;
        p >>= 1;
    }
    return r;
}

int modinv(int z) {
    return modpow(z, mod - 2);
}

vector<int> mul(vector<int> a, vector<int> b) {
    vector<int> c(a.size() + b.size() - 1);
    for (size_t i = 0; i < a.size(); i++) {
        for (size_t j = 0; j < b.size(); j++) {
            c[i + j] = (c[i + j] + 1LL * a[i] * b[j]) % mod;
        }
    }
    return c;
}

int modsub(int a, int b) {
    return a - b < 0 ? a - b + mod : a - b;
}
int mul(int64_t a, int64_t b) {
    return static_cast<int>(a * b % mod);
}
int modadd(int a, int b) {
    return a + b >= mod ? a + b - mod : a + b;
}

int eval(vector<int> p, int x) {
    int s = 0;
    int prod = 1;
    for (int j = 0; j < p.size(); j++) {
        s = modadd(s, mul(prod , p[j]));
        prod = mul(prod, x);
    }
    return s;
}

vector<int> interpolate(vector<pair<int,int>> pts) {
    const int n = pts.size();
    vector<int> res(n);

    for (int i = 0; i < n; i++) {
        vector<int> tmp{pts[i].second};
        for (int j = 0; j < n; j++) {
            if (j != i)
                tmp[0] = mul(tmp[0],
                        modinv(
                            modsub(pts[i].first, pts[j].first)
                            ));
        }
        for (int j = 0; j < n; j++) {
            if (j != i)
                tmp = mul(tmp, {mod-pts[j].first, 1});
        }
        for (int i = 0; i < n; i++) {
            res[i] = modadd(res[i], tmp[i]);
        }
    }

    debug(n);
    for (int i = 0; i < n; i++) {
        auto [x, y] = pts[i];
        assert (eval(res, x) == y);
    }

    return res;
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    vector<int> poly[6][10];

    for (int n = 1; n <= 6; n++) {

        vector<pair<int,int>> pr[6];
        for (int m = 1; m <= 6; m++) {
            memset(cnt, 0, sizeof(cnt));
            dfs(n, m, 0, 0, 0);
            orange(cnt, cnt + 6);
            for (int k = 1; k <= 5; k++) {
                pr[k].emplace_back(m, cnt[k]);
            }
        }

        for (int k = 1; k <= 5; k++) {
            poly[k][n] = interpolate(pr[k]);
        }

    }

    {
        int N, M, k;
        cin >> N >> M >> k;

        vector<int> coef(6);
        for (int j = 0; j < 6; j++) {
            vector<pair<int,int>> tmp;
            for (int n = 1; n <= 6; n++) {
                tmp.emplace_back(n, poly[k][n][j]);
            }
            auto ret = interpolate(tmp);
            coef[j] = eval(ret, N);
        }

        cout << eval(coef, M) << '\n';
    }
    return 0;
}