#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int out = 0, fh = 1;
  char jp = getchar();
  while ((jp > '9' || jp < '0') && jp != '-') jp = getchar();
  if (jp == '-') fh = -1, jp = getchar();
  while (jp >= '0' && jp <= '9') out = out * 10 + jp - '0', jp = getchar();
  return out * fh;
}
const int P = 998244353;
inline int add(int a, int b) { return (a + b) % P; }
inline int mul(int a, int b) { return 1LL * a * b % P; }
int fpow(int a, int b) {
  int res = 1;
  while (b) {
    if (b & 1) res = mul(res, a);
    a = mul(a, a);
    b >>= 1;
  }
  return res;
}
int inv(int x) { return fpow(x, P - 2); }
const int MAXN = 2019 << 1;
int n, l, k;
int fac[MAXN];
int f[MAXN][MAXN];
int main() {
  n = read(), k = read();
  l = read();
  int perl = mul(l, inv(2 * n + 1));
  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 < 2 * n; ++i) {
    for (int j = n < i ? n : i; j >= 0; --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(f[i][j], j));
    }
  }
  int ans = 0;
  for (int i = 1; i < 2 * n; ++i)
    for (int j = k; j <= n; ++j) {
      int tmp = mul(f[i][j], f[2 * n - i][j]);
      tmp = mul(tmp, fac[j]);
      ans = add(ans, tmp);
    }
  cout << mul(ans, mul(perl, inv(f[2 * n][0])));
  return 0;
}
