#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long modpow(long long b, long long e, long long m) {
  long long r = 1;
  while (e) {
    if (e % 2) {
      r *= b;
      r %= m;
    }
    b *= b;
    b %= m;
    e /= 2;
  }
  return r;
}
long long inv(long long b) { return modpow(b, MOD - 2, MOD); }
void solve() {
  int n, k, l;
  cin >> n >> k >> l;
  vector<long long> dp;
  long long divdiv = inv(2 * n + 1);
  dp.resize(n + 1);
  dp[0] = 1;
  long long ret = 0;
  for (int e = 2 * n; e > 0; e--) {
    vector<long long> ndp;
    ndp.resize(n + 1);
    long long denom = inv(e);
    for (int i = 0; i < dp.size(); i++) {
      if (dp[i] == 0) continue;
      if (i >= k) {
        ret += dp[i];
        ret %= MOD;
      }
      int canOpen = e - i;
      int canClose = i;
      if (i + 1 < ndp.size()) {
        long long inc = canOpen;
        inc *= denom;
        inc %= MOD;
        inc *= dp[i];
        inc %= MOD;
        ndp[i + 1] += inc;
        ndp[i + 1] %= MOD;
      }
      if (i - 1 >= 0) {
        long long inc = canClose;
        inc *= denom;
        inc %= MOD;
        inc *= dp[i];
        inc %= MOD;
        ndp[i - 1] += inc;
        ndp[i - 1] %= MOD;
      }
    }
    dp = ndp;
  }
  ret *= l;
  ret %= MOD;
  ret *= divdiv;
  ret %= MOD;
  cout << ret << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
}
