#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;
using ld = long double;

//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

const int mod = 998244353;
struct Mint {
  int val;
  Mint(ll x = 0): val((x % mod + mod) % mod) {;}
  Mint operator +(const Mint& x) { return Mint(val + x.val); }
  Mint operator -(const Mint& x) { return Mint(val - x.val); }
  Mint operator *(const Mint& x) { return Mint((ll)val * x.val); }
  Mint operator +=(const Mint& x) { return *this = Mint(val + x.val); }
  Mint operator -=(const Mint& x) { return *this = Mint(val - x.val); }
  Mint operator *=(const Mint& x) { return *this = Mint((ll)val * x.val); }
  Mint operator ^(const int& _b) const {
    Mint accum = 1, a = *this;
    int b = _b;
    while(b) {
      accum = (b & 1? accum * a : accum);
      a *= a;
      b >>= 1;
    }
    return accum;
  }
  Mint operator /(const Mint& x) { return Mint((ll)val * (x ^ (mod - 2)).val); }
  Mint operator /=(const Mint& x) { return *this = Mint((ll)val * (x ^ (mod - 2)).val); }
};

namespace COMBI {
  const int nmax = 5e5 + 5;  
  Mint fact[nmax], invfact[nmax];
  void init(int n = nmax - 1) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;
    invfact[n] = Mint(1) / fact[n];
    for(int i = n; i > 0; i--) invfact[i - 1] = invfact[i] * Mint(i);
    return;
  }
  Mint f(int n) { return fact[n]; }
  Mint invf(int n) { return invfact[n]; }
  Mint ncr(int n, int r) { return fact[n] * invfact[r] * invfact[n - r]; }
}

const int nmax = 5e3 + 5;

struct DP {
   vector<Mint> dp[nmax];
   Mint& operator ()(int a, int b) {
      if(sz(dp[a]) <= b) dp[a].resize(b + 1, Mint(0));
      return dp[a][b];
   }
   Mint get(int a, int b) const {
      if(sz(dp[a]) <= b) return Mint(0);
      return dp[a][b];
   }
   void transition(const DP& from, int m, int limk, int flip) {
      for(int i = 0; i <= m; i++)
         dp[i].clear();
      for(int zero = 0; zero <= m; zero++) {
         for(int kbef = 0; kbef <= limk; kbef++) {
            if(from.get(zero, kbef).val == 0) continue;
            for(int a = 0; a <= zero; a++) {
               for(int b = (flip ^ 1 ^ (a % 2)); b <= m - zero; b += 2) {
                  //if(zero == m && a == m && b == 0 && kbef == 0) cerr << zero << ' ' << kbef << '\t' << zero - a + b << ' ' << kbef + a + b << '\t' << from.get(zero, kbef).val << ' ' << (COMBI::ncr(zero, a) * COMBI::ncr(m - zero, b)).val << '\n';;
                  (*this)(zero - a + b, kbef + a + b) += from.get(zero, kbef) * COMBI::ncr(zero, a) * COMBI::ncr(m - zero, b);
               }
            }
         }
      }
      return;
   }
};

signed main() {
   COMBI::init();
   cin.tie(0) -> sync_with_stdio(0);
   int n, m, k;
   cin >> n >> m >> k;
   
   if(k % 2 != n % 2 || k % 2 != m % 2) {
      cout << "0\n";
      return 0;
   }
   
   if(n < m) swap(n, m);
   int flip = 0;
   if(n % 2 == 1 && k > n * m - k) {
      flip = 1;
      k = n * m - k;
   }
   else if(n % 2 == 0)
      k = min(n * m - k, k);
   
   DP start;
   start(m, 0) = 1;
   for(int i = 1; i <= n; i++) {
      auto lz = start;
      start.transition(lz, m, min(i * (m - 1 + (m % 2)), k), flip);
      //cerr << start(0, 3).val << '\n';
   }
   
   cout << (flip? start(m, k) : start(0, k)).val << '\n';
}

/**
  Anul asta nu se da centroid
  -- Rugaciunile mele
*/