#include <bits/stdc++.h>
using namespace std;
const int N = 4010, mod = 998244353;
int n, k, l, f[N][N], fac[N], ans;
int ksm(int x, int y) {
  int s = 1;
  for (; y; y >>= 1, x = (long long)x * x % mod)
    if (y & 1) s = (long long)s * x % mod;
  return s;
}
inline void upd(int &x, int y) {
  x += y;
  x -= x >= mod ? mod : 0;
}
int main() {
  scanf("%d%d%d", &n, &k, &l);
  l = (long long)l * ksm(n << 1 | 1, mod - 2) % mod;
  fac[0] = 1;
  for (int i = (1); i <= (n); i++) fac[i] = (long long)fac[i - 1] * i % mod;
  f[0][0] = 1;
  int tmp;
  for (int i = (1); i <= (n << 1); i++)
    for (int j = (0); j <= (min(n, i - 1)); j++)
      if (tmp = f[i - 1][j]) {
        upd(f[i][j + 1], tmp);
        if (j) upd(f[i][j - 1], (long long)tmp * j % mod);
      }
  for (int i = (1); i <= (n << 1); i++)
    for (int j = (k); j <= (min(n, i)); j++)
      upd(ans, (long long)f[i][j] * f[(n << 1) - i][j] % mod * fac[j] % mod);
  ans = (long long)ans * ksm(f[n << 1][0], mod - 2) % mod * l % mod;
  printf("%d\n", ans);
  return 0;
}
