#include <bits/stdc++.h>
using namespace std;
int N, K, L;
long long dp[4005][2005][2];
const int fish = 998244353;
long long Pow(long long x, int y) {
  long long ans = 1, b = x;
  while (y != 0) {
    if (y % 2) ans = (1ll * ans * b) % fish;
    y /= 2;
    b = (1ll * b * b) % fish;
  }
  return ans;
}
int main() {
  scanf("%d%d%d", &N, &K, &L);
  dp[0][0][0] = 1;
  for (int i = 1; i <= 2 * N + 1; i++)
    for (int j = 0; j <= N; j++)
      for (int k = 0; k <= 1; k++) {
        if (!k && j >= K) dp[i][j][1] = (dp[i][j][1] + dp[i - 1][j][0]) % fish;
        if (i + j - 1 < 2 * N + k && j - 1 >= 0) {
          dp[i][j][k] = (dp[i][j][k] + dp[i - 1][j - 1][k]) % fish;
        }
        dp[i][j][k] =
            (dp[i][j][k] + 1ll * dp[i - 1][j + 1][k] * (j + 1) % fish) % fish;
      }
  long long fac = 1;
  for (int i = N + 1; i <= 2 * N + 1; i++) fac = (1ll * fac * i) % fish;
  long long Ny = Pow(fac, fish - 2);
  long long ans = 1ll * dp[2 * N + 1][0][1] * 1ll;
  ans = 1ll * ans * Ny % fish;
  ans = 1ll * ans * L % fish;
  ans = ans * Pow(2, N) % fish;
  cout << ans;
  return 0;
}
