#include <bits/stdc++.h>
inline long long gi() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  return x * f;
}
inline int pow(int x, int y) {
  int ret = 1;
  while (y) {
    if (y & 1) ret = 1ll * ret * x % 998244353;
    x = 1ll * x * x % 998244353;
    y >>= 1;
  }
  return ret;
}
int f[4010][2010], p[2010];
int main() {
  int n = gi(), k = gi(),
      l = 1ll * gi() * pow(n << 1 | 1, 998244353 - 2) % 998244353;
  p[0] = 1;
  for (int i = 1; i <= n; ++i) p[i] = 1ll * i * p[i - 1] % 998244353;
  f[0][0] = 1;
  for (int i = 0; i < n << 1; ++i) {
    for (int j = std::min(n, i); ~j; --j) {
      f[i + 1][j + 1] = (f[i + 1][j + 1] + f[i][j]) % 998244353;
      if (j)
        f[i + 1][j - 1] = (f[i + 1][j - 1] + 1ll * f[i][j] * j) % 998244353;
    }
  }
  int ans = 0;
  for (int i = 1; i <= n << 1; ++i)
    for (int j = k; j <= n; ++j)
      ans = (ans + 1ll * f[i][j] * f[(n << 1) - i][j] % 998244353 * p[j]) %
            998244353;
  printf("%lld\n", 1ll * ans * l % 998244353 *
                       pow(f[n << 1][0], 998244353 - 2) % 998244353);
  return 0;
}
