#include <bits/stdc++.h>
using namespace std;

long long mod = 998244353;
//入力が必ず-mod<a<modの時.
struct mint{
    long long v = 0;
    mint(){} mint(int a){v = a<0?a+mod:a;} mint(long long a){v = a<0?a+mod:a;}
    mint(unsigned long long a){v = a;}
    long long val(){return v;}
    void modu(){v %= mod;}
 
    mint repeat2mint(const long long a,long long b){
        mint ret = 1,p = a;
        while(b){
            if(b&1) ret *= p;
            p *= p; b >>= 1;
        }
        return ret;
    };
 
    mint &operator=(const mint &b) = default;
    mint operator-() const {return mint(0)-(*this);}
    mint operator+(const mint b){return mint(v)+=b;}
    mint operator-(const mint b){return mint(v)-=b;}
    mint operator*(const mint b){return mint(v)*=b;}
    mint operator/(const mint b){return mint(v)/=b;}
 
    mint operator+=(const mint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    mint operator-=(const mint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    mint operator*=(const mint b){v = v*b.v%mod; return *this;}
    mint operator/=(mint b){
        if(b == 0) assert(false);
        int left = mod-2;
        while(left){if(left&1) *this *= b; b *= b; left >>= 1;}
        return *this;
    }
 
    mint operator++(int){*this += 1; return *this;}
    mint operator--(int){*this -= 1; return *this;}
    bool operator==(const mint b){return v == b.v;}
    bool operator!=(const mint b){return v != b.v;}
    bool operator>(const mint b){return v > b.v;}
    bool operator>=(const mint b){return v >= b.v;}
    bool operator<(const mint b){return v < b.v;}
    bool operator<=(const mint b){return v <= b.v;}
 
    mint pow(const long long x){return repeat2mint(v,x);}
    mint inv(){return mint(1)/v;}
};

template<typename T>
vector<vector<T>> multima(vector<vector<T>> &A,vector<vector<T>> &B){
    int H = A.size(),W = B.at(0).size();
    vector<vector<T>> ret(H,vector<T>(W));
    for(int i=0; i<H; i++) for(int k=0; k<W; k++){
        for(int l=0; l<A.at(i).size(); l++){
            ret.at(i).at(k) += A.at(i).at(l)*B.at(l).at(k);
        }
    }
    return ret; //計算できる行列のみ.
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N,T; cin >> N >> T;
    int K,L; cin >> K >> L;

    mint one = mint(K-1)/6,two = mint(L-K)/6,three = mint(1)-one-two;
    vector<vector<mint>> Z(T,vector<mint>(T)),A(T,vector<mint>(1));
    A.at(0).at(0) = 1;
    for(int i=0; i<T; i++){
        vector<mint> dp(2*T);
        dp.at(i) = 1;
        for(int k=0; k<T; k++) if(dp.at(k) > 0){
            dp.at(k+1) += dp.at(k)*one;
            dp.at(k+2) += dp.at(k)*two;
            dp.at(k+T) += dp.at(k)*three;
        }
        for(int k=T; k<2*T; k++) Z.at(i).at(k-T) = dp.at(k); 
    }

    int left = N/T;
    while(left){
        if(left&1) A = multima(Z,A);
        Z = multima(Z,Z); left >>= 1;
    }
    N--;
    N %= T;

    for(int i=0; i<T; i++){
        if(i+1 < T) A.at(i+1).at(0) += A.at(i).at(0)*one;
        if(i+2 < T) A.at(i+2).at(0) += A.at(i).at(0)*two;
    }
    cout << A.at(N).at(0).v << endl;
}