#include <bits/stdc++.h>
using namespace std;
const int p = 998244353;
template <typename T>
inline T read() {
  register T sum = 0;
  register char cc = getchar();
  int sym = 1;
  while (cc != '-' && (cc > '9' || cc < '0')) cc = getchar();
  if (cc == '-') sym = -1, cc = getchar();
  sum = sum * 10 + cc - '0';
  cc = getchar();
  while (cc >= '0' && cc <= '9') sum = sum * 10 + cc - '0', cc = getchar();
  return sym * sum;
}
template <typename T>
inline T read(T& a) {
  a = read<T>();
  return a;
}
template <typename T, typename... Others>
inline void read(T& a, Others&... b) {
  a = read(a);
  read(b...);
}
int n, l, K, ans, fac[4010], f[4010][4010];
int add(int x, int y) { return (x + y) % p; }
int mul(int x, int y) { return 1ll * x * y % p; }
int fpow(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) res = mul(res, x);
    x = mul(x, x);
    y >>= 1;
  }
  return res;
}
int main() {
  read(n, K, l);
  l = mul(l, fpow((n << 1) + 1, p - 2));
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = mul(fac[i - 1], i);
  f[0][0] = 1;
  for (int i = 0; i < n << 1; i++)
    for (int j = 0; j <= min(n, i); j++) {
      f[i + 1][j + 1] = add(f[i + 1][j + 1], f[i][j]);
      if (j) f[i + 1][j - 1] = add(f[i + 1][j - 1], mul(j, f[i][j]));
    }
  for (int i = 1; i <= n << 1; i++)
    for (int j = K; j <= n; j++)
      ans = add(ans, mul(mul(f[i][j], f[(n << 1) - i][j]), fac[j]));
  printf("%d\n", mul(mul(ans, l), fpow(f[n << 1][0], p - 2)));
  return 0;
}
