#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
const double pi = acos(-1.0);
int n, k, l;
long long dp[4020][4020], fac[4040];
int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while ((ch < '0') || (ch > '9')) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while ((ch >= '0') && (ch <= '9')) {
    x = x * 10 + (ch - '0');
    ch = getchar();
  }
  return x * f;
}
long long qpow(long long x, int y) {
  long long ans = 1;
  while (y) {
    if (y & 1) ans = (ans * x) % 998244353;
    x = (x * x) % 998244353;
    y >>= 1;
  }
  return ans;
}
long long inv(long long x) { return qpow(x, 998244353 - 2); }
int main() {
  n = read();
  k = read();
  l = read();
  dp[0][0] = 1;
  for (int i = 0; i <= n * 2; i++) {
    for (int j = 0; j <= min(i, n); j++) {
      dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j]) % 998244353;
      dp[i + 1][j - 1] = (dp[i + 1][j - 1] + dp[i][j] * j) % 998244353;
    }
  }
  fac[0] = 1;
  for (int i = 1; i <= 4000; i++) fac[i] = (fac[i - 1] * i) % 998244353;
  long long ans = 0;
  for (int i = 1; i <= n * 2; i++) {
    for (int j = k; j <= min(i, n); j++) {
      ans = (ans +
             ((dp[i][j] * dp[n * 2 - i][j]) % 998244353 * fac[j]) % 998244353) %
            998244353;
    }
  }
  long long len = l * inv(n * 2 + 1) % 998244353;
  ans = ans * inv(dp[n * 2][0]) % 998244353;
  ans = ans * len % 998244353;
  printf("%lld", ans);
  return 0;
}
