#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (n); ++i)

using namespace std;
using mint = modint998244353;

struct modinv {
  int n; vector<mint> d;
  modinv(): n(2), d({0,1}) {}
  mint operator()(int i) {
    while (n <= i) d.push_back(-d[mint::mod()%n]*(mint::mod()/n)), ++n;
    return d[i];
  }
  mint operator[](int i) const { return d[i];}
} invs;
struct modfact {
  int n; vector<mint> d;
  modfact(): n(2), d({1,1}) {}
  mint operator()(int i) {
    while (n <= i) d.push_back(d.back()*n), ++n;
    return d[i];
  }
  mint operator[](int i) const { return d[i];}
} facts;
struct modfactinv {
  int n; vector<mint> d;
  modfactinv(): n(2), d({1,1}) {}
  mint operator()(int i) {
    while (n <= i) d.push_back(d.back()*invs(n)), ++n;
    return d[i];
  }
  mint operator[](int i) const { return d[i];}
} ifacts;
mint comb(int n, int k) {
  if (n < k || k < 0) return 0;
  return facts(n)*ifacts(k)*ifacts(n-k);
}

mint f(int c, int k, int u) {
    mint res;
    int r = min(c, k/(u+1));
    rep(j, r+1) {
        mint now = comb(c, j)*comb(k-j*(u+1)+c-1, c-1);
        if (j&1) res -= now;
        else res += now;
    }
    return res;
}

int main() {
    int n, m, k, l;
    cin >> n >> m >> k >> l;
    
    mint ans;
    int tot = m*k;
    
    for (int x = l; x <= m; ++x) {
        int r = tot-x;
        ans += f(n-1, r, m) - f(n-1, r, x);
    }
    
    cout << ans.val() << '\n';
    
    return 0;
}