#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e3;
const int MOD = 998244353;
int n, k, l;
long long inverse[2 * MAXN + 2], factorial[2 * MAXN + 2],
    inversefactorial[2 * MAXN + 2], power2[2 * MAXN + 2], dp[MAXN + 1];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cin >> n >> k >> l;
  inverse[1] = 1;
  for (int i = 2; i < 2 * MAXN + 2; ++i)
    inverse[i] = MOD - MOD / i * inverse[MOD % i] % MOD;
  factorial[0] = inversefactorial[0] = power2[0] = 1;
  for (int i = 1; i < 2 * MAXN + 2; ++i) {
    factorial[i] = factorial[i - 1] * i % MOD;
    inversefactorial[i] = inversefactorial[i - 1] * inverse[i] % MOD;
    power2[i] = power2[i - 1] * 2 % MOD;
  }
  for (int i = n; i >= k; --i) {
    dp[i] = factorial[i] * factorial[i] % MOD * power2[i] % MOD *
            inversefactorial[2 * i + 1] % MOD;
    dp[i] = dp[i] * factorial[n] % MOD * inversefactorial[i] % MOD *
            inversefactorial[n - i] % MOD;
    for (int j = i + 1; j <= n; ++j) {
      dp[i] = (dp[i] -
               factorial[j] * inversefactorial[i] % MOD *
                   inversefactorial[j - i] % MOD * dp[j] % MOD +
               MOD) %
              MOD;
    }
  }
  long long ans = 0;
  for (int i = k; i <= n; ++i) ans = (ans + dp[i]) % MOD;
  cout << ans * l % MOD << endl;
  return 0;
}
