#include <bits/stdc++.h>
using namespace std;
const int MAXN = 4005;
int n, k, l;
long long fac[MAXN], finv[MAXN], f[MAXN][MAXN][2];
inline long long qpow(long long a, int b) {
  long long res = 1;
  for (; b; a = a * a % 998244353, b >>= 1)
    if (b & 1) res = res * a % 998244353;
  return res;
}
inline long long getInv(int x) { return qpow(x, 998244353 - 2); }
int main() {
  cin >> n >> k >> l;
  fac[0] = finv[0] = 1;
  for (int i = 1; i <= 2 * n + 1; i++)
    fac[i] = fac[i - 1] * i % 998244353,
    finv[i] = finv[i - 1] * getInv(i) % 998244353;
  f[0][0][0] = 1;
  for (int i = 1; i <= 2 * n + 1; i++)
    for (int j = 0; j <= i; j++)
      for (int p = 0; p <= 1; p++) {
        if (j >= k && p == 1)
          f[i][j][p] = (f[i][j][p] + f[i - 1][j][0]) % 998244353;
        if (j > 0 && i + j <= 2 * n + p)
          f[i][j][p] = (f[i][j][p] + f[i - 1][j - 1][p]) % 998244353;
        f[i][j][p] =
            (f[i][j][p] + f[i - 1][j + 1][p] * (j + 1) % 998244353) % 998244353;
      }
  cout << l * f[2 * n + 1][0][1] % 998244353 * fac[n] % 998244353 * qpow(2, n) %
              998244353 * finv[2 * n + 1] % 998244353
       << endl;
  return 0;
}
