#include <bits/stdc++.h>
using namespace std;
const int mu = 998244353;
int dp[4010][4010][2], n, k, l, fac[5010];
void reduce(int &x) { x += x >> 31 & mu; }
int ksm(int x, int y, int ans = 1) {
  for (; y; y >>= 1, x = 1ll * x * x % mu)
    if (y & 1) ans = 1ll * ans * x % mu;
  return ans;
}
int main() {
  scanf("%d %d %d", &n, &k, &l);
  dp[0][0][0] = 1;
  for (int i = 0; i <= n * 2; i++)
    for (int j = 0; j <= i; j++)
      for (int o = 0; o <= 1; o++) {
        reduce(dp[i + 1][j + 1][o] += dp[i][j][o] - mu);
        if (o == 0 && j >= k) reduce(dp[i + 1][j][1] += dp[i][j][o] - mu);
        if (j) reduce(dp[i + 1][j - 1][o] += 1ll * dp[i][j][o] * j % mu - mu);
      }
  fac[0] = 1;
  for (int i = 1; i <= n * 2 + 1; i++) fac[i] = 1ll * fac[i - 1] * i % mu;
  printf("%d\n", 1ll * dp[n * 2 + 1][0][1] * ksm(2, n) % mu * fac[n] % mu *
                     ksm(fac[n * 2 + 1], mu - 2) % mu * l % mu);
  return 0;
}
