#include "bits/stdc++.h" #include "atcoder/all" using namespace std; using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; using mint = modint998244353; const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" struct combination { vector fact, ifact; combination(int n) :fact(n + 1), ifact(n + 1) { assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i; } mint operator()(int n, int k) { return com(n, k); } mint com(int n, int k) { if (n < 0) return com(-n, k) * (k % 2 ? -1 : 1); if (k < 0 || k > n) return 0; return fact[n] * ifact[k] * ifact[n - k]; } mint inv(int n, int k) { if (n < 0) return inv(-n, k) * (k % 2 ? -1 : 1); if (k < 0 || k > n) return 0; return ifact[n] * fact[k] * fact[n - k]; } }c(9000001); int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int N, M, K; cin >> N >> M >> K; mint ans = 0; rep(i, K + 1) {//6000 int x = i; int y = K - i; if ((x > N) || (y > N)) { continue; } /* 残るのはN-x * N-y のゾーン */ mint anssub = 0; rep(j, N - x + 1) { rep(k, N - y + 1) { mint anssubsub = c(N - x, j)*c(N - y, k)*c((N - x - j)*(N - y - k), M); if (0 == (j + k) % 2) { anssub += anssubsub; } else { anssub -= anssubsub; } } } ans += anssub * c(N, x)*c(N, y); } cout << ans.val() << endl; return 0; }