#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2005, MOD = 998244353;
long long dp[MAXN * 2][MAXN], l, ans, f[MAXN];
int n, k;
long long rev(long long a) {
  int b = MOD - 2;
  long long res = 1;
  do {
    if (b % 2) res *= a, res %= MOD;
    a *= a, a %= MOD;
  } while (b /= 2);
  return res;
}
int main() {
  cin >> n >> k >> l;
  dp[0][0] = 1;
  for (int i = 1; i <= 2 * n; i++)
    for (int j = 0; j <= min(n, i); j++) {
      dp[i][j] += dp[i - 1][j + 1] * (j + 1) % MOD;
      if (j > 0) dp[i][j] += dp[i - 1][j - 1];
      dp[i][j] %= MOD;
    }
  f[0] = 1;
  for (int i = 1; i < MAXN; i++) f[i] = f[i - 1] * i % MOD;
  long long M = l * rev(dp[2 * n][0] * (2 * n + 1) % MOD) % MOD;
  for (int i = 1; i < 2 * n; i++)
    for (int j = k; j <= n; j++) {
      long long w = dp[i][j] * dp[2 * n - i][j] % MOD;
      w *= f[j], w %= MOD;
      ans += w * M % MOD;
      ans %= MOD;
    }
  cout << ans;
}
