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

#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define aut(r,v) __typeof(v) r = (v)
#define each(it,o) for(aut(it,(o).begin()); it!=(o).end(); ++it)
#define reach(it,o) for(aut(it,(o).rbegin()); it!=(o).rend(); ++it)
#define fi first
#define se second
#define debug(...) {cerr<<"[L"<<__LINE__<<"] "; _debug(__VA_ARGS__);}

template<typename T1, typename T2> ostream& operator<<(ostream& o, const pair<T1, T2>& p)
{return o<<"("<<p.first<<", "<<p.second<<")";}
template<typename T>string join(const vector<T>&v, string del=", ")
{stringstream s;rep(i,v.size())s<<del<<v[i];return s.str().substr(del.size());}
template<typename T>ostream& operator<<(ostream& o, const vector<T>&v)
{if(v.size())o<<"["<<join(v)<<"]";return o;}
template<typename T>ostream& operator<<(ostream& o, const vector<vector<T> >&vv)
{int l=vv.size();if(l){o<<endl;rep(i,l){o<<(i==0?"[ ":",\n  ")<<vv[i]<<(i==l-1?" ]":"");}}return o;}
template<typename T>ostream& operator<<(ostream& o, const set<T>& st)
{vector<T> v(st.begin(),st.end());o<<"{ "<<join(v)<<" }";return o;}
template<typename T1, typename T2>ostream& operator<<(ostream& o, const map<T1, T2>& m)
{each(p,m){o<<(p==m.begin()?"{ ":",\n  ")<<*p<<(p==--m.end()?" }":"");}return o;}
inline void _debug(){cerr<<endl;}
template<class First, class... Rest>
void _debug(const First& first, const Rest&... rest){cerr<<first<<" ";_debug(rest...);}

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;

const double PI = (1*acos(0.0));
const double EPS = 1e-9;
const ll INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3fLL;
const ll mod = 998244353;

inline void finput(string filename) {
    freopen(filename.c_str(), "r", stdin);
}

ll mod_pow(ll x, ll n){
    ll v = 1;
    for(; n; x=x*x%mod, n>>=1)
        if(n & 1) v = v * x % mod;
    return v;
}
ll mod_inv(ll x){
    return mod_pow(x, mod-2);
}
struct Factorial{
    vector<ll> fact;
    vector<ll> factinv;
    Factorial(int n){
        fact = vector<ll>(n+1);
        factinv = vector<ll>(n+1);
        fact[0] = 1;
        REP(i,1,n+1) fact[i] = fact[i-1] * i % mod;
        factinv[n] = mod_inv(fact[n]);
        RREP(i,1,n+1) factinv[i-1] = factinv[i] * i % mod;
    }
    ll C(int n, int k){
        if(k<0 || k>n) return 0;
        return fact[n] * factinv[n-k] % mod * factinv[k] % mod;
    }
    ll P(int n, int k){
        if(k<0 || k>n) return 0;
        return fact[n] * factinv[n-k] % mod;
    }
    ll H(int n, int k){
        if(n==0 && k==0) return 1;
        return C(n+k-1, k);
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    // finput("./input");

    ll n,a,b,k;
    cin >> n >> a >> b >> k;
    Factorial fa(n*10);
    ll ans = 0;
    rep(x,n+1){
        ll l=0, r=n+1;
        while(r-l > 1){
            int m = (l+r) / 2;
            if(a*x+b*m <= k) l = m;
            else r = m;
        }
        ll y = l;
        if(a*x+b*y != k) continue;
        ans += fa.C(n,x) * fa.C(n,y) % mod;
        ans %= mod;
    }
    cout << ans << endl;
    return 0;
}

Measured memory_bytes: 47104