#include <bits/stdc++.h>
using namespace std;
int const p = 998244353;
int fac[4005], inv[4005], iv[4005];
int c(int n, int m) { return 1ll * fac[n] * inv[m] % p * inv[n - m] % p; }
int gamma(int n, int m) {
  return 1ll * fac[n - 1] * fac[m - 1] % p * inv[n + m - 1] % p;
}
int main() {
  int n, k, l, ans = 0, now = 1;
  cin >> n >> k >> l;
  fac[0] = fac[1] = inv[0] = inv[1] = iv[1] = 1;
  for (int i = 2; i <= 2 * n + 1; i++)
    iv[i] = p - 1ll * iv[p % i] * (p / i) % p;
  for (int i = 2; i <= 2 * n + 1; i++)
    fac[i] = 1ll * fac[i - 1] * i % p, inv[i] = 1ll * inv[i - 1] * iv[i] % p;
  for (int i = 1; i <= k; i++) now = 2 * now % p;
  for (int i = k; i <= n; i++, now = 2 * now % p)
    ans = (ans + 1ll * (((i - k) & 1) ? p - 1 : 1) * c(i - 1, i - k) % p *
                     c(n, i) % p * now % p * gamma(i + 1, i + 1)) %
          p;
  cout << 1ll * l * ans % p;
  return 0;
}
