#include <bits/stdc++.h>
using namespace std;
const int MAX = 4010, MOD = 998244353;
long long dp[MAX][MAX][2], fact[MAX];
int n, k, l;
void precalc() {
  fact[0] = 1ll;
  for (int i = 1; i < MAX; i++) fact[i] = (1ll * i * fact[i - 1]) % MOD;
}
long long fpow(long long b, int p) {
  long long r = 1ll;
  while (p > 0) {
    if (p & 1) r = (1ll * r * b) % MOD;
    p >>= 1;
    b = (1ll * b * b) % MOD;
  }
  return r;
}
long long solve() {
  long long tmp = (1ll * dp[2 * n + 1][0][1] * fpow(2, n)) % MOD;
  tmp = (1ll * tmp * fact[n]) % MOD;
  tmp = (1ll * tmp * fpow(fact[2 * n + 1], MOD - 2)) % MOD;
  return (1ll * tmp * l) % MOD;
}
int main() {
  scanf("%d%d%d", &n, &k, &l);
  precalc();
  dp[0][0][0] = 1;
  for (int i = 0; i <= 2 * n + 1; i++) {
    for (int j = 0; j <= n; j++) {
      for (int b = 0; b <= 1; b++) {
        if (j >= k && b == 0)
          dp[i + 1][j][1] = (dp[i + 1][j][1] + dp[i][j][b]) % MOD;
        if (j)
          dp[i + 1][j - 1][b] =
              (dp[i + 1][j - 1][b] + 1ll * dp[i][j][b] * j % MOD) % MOD;
        if (i + j + 1 <= 2 * n + b)
          dp[i + 1][j + 1][b] = (dp[i + 1][j + 1][b] + dp[i][j][b]) % MOD;
      }
    }
  }
  printf("%d\n", solve());
  return 0;
}
