#include <bits/stdc++.h>
using namespace std;
long long n, k, l, f[2050][2050][2];
long long powM(long long a, long long t) {
  long long ans = 1;
  while (t) {
    if (t & 1) ans = ans * a % 998244353;
    a = a * a % 998244353;
    t >>= 1;
  }
  return ans;
}
int main() {
  scanf("%I64d%I64d%I64d", &n, &k, &l);
  f[0][0][0] = 1;
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= i; j++) {
      if (i) {
        f[i][j][0] = (f[i][j][0] + f[i - 1][j][0]) % 998244353;
        f[i][j][1] = (f[i][j][1] + f[i - 1][j][1]) % 998244353;
      }
      if (j) {
        f[i][j][0] =
            (f[i][j][0] + 1ll * (i - j + 1) * f[i][j - 1][0]) % 998244353;
        f[i][j][1] =
            (f[i][j][1] + 1ll * (i - j + 1) * f[i][j - 1][1]) % 998244353;
      }
      if (i - j >= k) f[i][j][1] = (f[i][j][1] + f[i][j][0]) % 998244353;
    }
  long ans = f[n][n][1];
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= i; j++) f[i][j][0] = f[i][j][1] = 0;
  f[0][0][0] = 1;
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= i; j++) {
      if (i) {
        f[i][j][0] = (f[i][j][0] + f[i - 1][j][0]) % 998244353;
        f[i][j][1] = (f[i][j][1] + f[i - 1][j][1]) % 998244353;
      }
      if (j) {
        f[i][j][0] =
            (f[i][j][0] + 1ll * (i - j + 1) * f[i][j - 1][0]) % 998244353;
        f[i][j][1] =
            (f[i][j][1] + 1ll * (i - j + 1) * f[i][j - 1][1]) % 998244353;
      }
      f[i][j][1] = (f[i][j][1] + f[i][j][0]) % 998244353;
    }
  printf("%I64d",
         l * ans % 998244353 * powM(f[n][n][1], 998244353 - 2) % 998244353);
  return 0;
}
