#include <bits/stdc++.h>
const int N = 2005, P = 998244353;
inline void Add(int& a, const int b) {
  if ((a += b) >= P) a -= P;
}
long long Pow(long long a, long long b, long long s = 1) {
  for (; b; b >>= 1, a = a * a % P)
    if (b & 1) s = s * a % P;
  return s;
}
int n, k, l, f[N * 2][N * 2][2], Fac[N * 2];
int main() {
  scanf("%d%d%d", &n, &k, &l), f[0][0][0] = 1;
  for (register int i = 0; i <= n << 1; ++i)
    for (register int j = 0; j <= i; ++j)
      for (register int o = 0; o <= 1; ++o) {
        Add(f[i + 1][j + 1][o], f[i][j][o]);
        if (!o && j >= k) Add(f[i + 1][j][1], f[i][j][o]);
        if (j) Add(f[i + 1][j - 1][o], (long long)f[i][j][o] * j % P);
      }
  for (register int i = *Fac = 1; i <= n * 2 + 1; ++i)
    Fac[i] = (long long)Fac[i - 1] * i % P;
  return printf("%lld\n", f[n << 1 | 1][0][1] * Pow(2, n) % P * Fac[n] % P *
                              Pow(Fac[n << 1 | 1], P - 2) % P * l % P),
         0;
}
