#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll MAX_X = 9000000;
    vector<mint> fact(MAX_X + 1);
    fact[0] = mint(1);
    for (ll i = 0; i < MAX_X; i++){
        fact[i + 1] = fact[i] * mint(i + 1);
    }
    vector<mint> finv(MAX_X + 1);
    finv[MAX_X] = mint(1) / fact[MAX_X];
    for (ll i = MAX_X - 1; i >= 0; i--){
        finv[i] = finv[i + 1] * mint(i + 1);
    }
    auto comb = [&fact, &finv](ll n, ll r){
        if (n < r) return mint(0);
        if (r < 0) return mint(0);
        return fact[n] * finv[n - r] * finv[r]; 
    };

    ll N, M, K, L;
    cin >> N >> M >> K >> L;

    // 第 1 項目が L 以上であるものの数は？
    // 第 1 項目は全探索できそう
    mint ans = mint(0);
    for (ll y = L; y <= M; y++){
        mint plus_sub = mint(0);
        mint minus_sub = mint(0);
        for (ll j = 0; j <= N - 1; j++){
            if (j % 2 == 0){
                plus_sub += comb(N - 1, j) * comb(M * K - y - (M + 1) * j + N - 2, N - 2);
            }
            else{
                plus_sub -= comb(N - 1, j) * comb(M * K - y - (M + 1) * j + N - 2, N - 2);
            }
        }
        ans += plus_sub;
        for (ll j = 0; j <= N - 1; j++){
            if (j % 2 == 0){
                minus_sub += comb(N - 1, j) * comb(M * K - y - (y + 1) * j + N - 2, N - 2);
            }
            else{
                minus_sub -= comb(N - 1, j) * comb(M * K - y - (y + 1) * j + N - 2, N - 2);
            }
        }
        ans -= minus_sub;
        // debug_out(plus_sub.val(), minus_sub.val());
    }
    cout << ans.val() << endl;
}