#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
long long f[4005], g[4005], p[4005];
long long cal(long long x, long long y) {
  long long ret = 1;
  while (y) {
    if (y % 2) ret = ret * x % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ret;
}
long long comb(long long x, long long y) {
  long long num = f[x];
  long long denum = g[y] * g[x - y] % mod;
  return num * denum % mod;
}
long long w(long long x) {
  long long ret = f[x] * f[x] % mod;
  ret = ret * g[2 * x + 1] % mod;
  return ret;
}
int main() {
  f[0] = g[0] = p[0] = 1;
  for (int i = 1; i <= 4004; i++) {
    f[i] = f[i - 1] * i % mod;
    g[i] = cal(f[i], mod - 2);
    p[i] = p[i - 1] * 2 % mod;
  }
  int n, k, l;
  cin >> n >> k >> l;
  long long ans = 0;
  for (int i = k; i <= n; i++) {
    long long temp = 0;
    for (int j = 0; j <= n - i; j++) {
      long long tmp = comb(n - i, j) * p[i + j] % mod;
      if (j % 2) tmp = -tmp;
      tmp = tmp * w(i + j) % mod;
      temp += tmp;
    }
    temp %= mod;
    temp = temp * comb(n, i) % mod;
    ans += temp;
  }
  ans %= mod;
  ans = ans * l % mod;
  ans += mod;
  ans %= mod;
  cout << ans << endl;
}
