#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int N = 4005, P = 998244353;
void add(int &a, int b) {
  a += b;
  a >= P ? a -= P : 0;
}
int mul(int a, int b) { return 1ll * a * b - 1ll * a * b / P * P; }
int f[N][N], fac[N], ans;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  for (; ch < '0' || ch > '9'; ch = getchar())
    if (ch == '-') f = -1;
  for (; ch >= '0' && ch <= '9'; ch = getchar())
    x = (x << 1) + (x << 3) + ch - '0';
  return x * f;
}
int Pow(int x, int t) {
  int res = 1;
  for (; t; t >>= 1, x = 1ll * x * x % P)
    if (t & 1) res = 1ll * res * x % P;
  return res;
}
int main() {
  int n = read() << 1, k = read(), l = read();
  f[0][0] = 1;
  for (register int i = (0); i <= (n); ++i)
    for (register int j = (0); j <= (min(n >> 1, i)); ++j) {
      add(f[i + 1][j + 1], f[i][j]);
      add(f[i + 1][j - 1], mul(f[i][j], j));
    }
  fac[0] = 1;
  for (register int i = (1); i <= (n); ++i) fac[i] = mul(fac[i - 1], i);
  for (register int i = (1); i <= (n); ++i)
    for (register int j = (k); j <= (min(n >> 1, i)); ++j)
      add(ans, mul(fac[j], mul(f[i][j], f[n - i][j])));
  ans = mul(ans, mul(mul(Pow(n + 1, P - 2), l), Pow(f[n][0], P - 2)));
  printf("%d\n", ans);
  return 0;
}
