#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
// const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
 
#define dump(x)  cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE"  ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible"  ) << endl
#define possible(n) cout << ((n) ? "possible" : "impossible"  ) << endl
 
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
 
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
 
#define FOREACH(x,a) for(auto& (x) : (a) )
 
#define WFA(d,v) REP(k,v)REP(i,v)REP(j,v)d[i][j]=min(d[i][j],d[i][k]+d[k][j])
 
#define SCOUT(x) cout<<(x)<<" "
#define ENDL cout<<endl
 
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define VECIN2(x,y) REP(i,x.size())cin>>x[i]>>y[i]
#define VECCOUT(x) if(1){for(auto tt=x.begin();tt!=x.end();tt++){if(tt!=x.begin())cout<<" ";cout<<(*tt);}cout<<endl;}
 
#define ALL(obj) (obj).begin(),(obj).end()
 
#define EXIST(n,x) (find(ALL(n),x)!=n.end())
#define UNIQUE(obj) sort(ALL( obj )); obj.erase(unique(ALL(obj)),obj.end())
#define EN(x) if(1){cout<<#x<<endl;return 0;}
#define COUT(x) cout<<(x)<<endl
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
    cin>>head;
    CINT(move(tail)...);
}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
 
template <class T = ll>
T IN(){T x;cin>>x;return (x);}
 
template <class Head>
void VT(Head head){}
template <class Head,class Seco,class... Tail>
void VT(Head&& head,Seco&& seco,Tail&&... tail){
    seco.resize(head);
    VT(head,move(tail)...);
}
void VT2(){}
template <class Head,class... Tail>
void VT2(Head&& head,Tail&&... tail){
    VECCIN(head);
    VT2(move(tail)...);
}
 
template <class Head>
void VT3(Head&& head){}
template <class Head,class Seco,class... Tail>
void VT3(Head&& head,Seco&& seco,Tail&&... tail){
    seco[head]=IN();
    VT3(head,move(tail)...);
}
 
#define VC1(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);VT2(__VA_ARGS__); //aaabbbccc
#define VC2(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);REP(i,n)VT3(i,__VA_ARGS__); //abcabcabc
 
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision; // cpp_int
 
#define P pair<ll,ll>
#define V vector<ll>
#define M map<ll,ll>
#define S set<ll>
 
#define pb(a) push_back(a)
#define mp make_pair

const ll MOD = 998244353;

ll sqMod(ll x){ 
  return 1LL*x*x%MOD;
}
ll powMod(ll x,ll n){//xのn乗
  if(n==0)return 1;
  else if(n==1)return x;
  if(n%2==0)return (sqMod(powMod(x,n/2)%MOD)%MOD);
  else return ((x*sqMod(powMod(x,n/2)%MOD)%MOD)%MOD);
}
V kaitable,gyakutable;
ll ncr(int n,int r){
  return 1LL * kaitable[n] * gyakutable[n-r] % MOD * gyakutable[r]% MOD;
}
ll nhr(int n,int r){
  return ncr(n+r-1,r);
}
void calcTable(int t){
  kaitable = V(t);
  gyakutable = V(t);
  kaitable[0]=1;
  gyakutable[0]=1;
  FOR(i,1,t){
    kaitable[i] = 1LL * kaitable[i-1] * i % MOD;
    gyakutable[i] = powMod(kaitable[i],MOD-2)%MOD;
  }
}

int main(){
    CIN(n,a,b);ll k;cin>>k;
    //a,b,cがある 決め打ちをしたい

    calcTable(2*n+1);

    ll ans = 0;

    REP(i,2*n+1){
        ll val = k-(1LL * a * i);

        if(val<0||val%b)continue;
        ll j = val/b;

        ll mi = min(1LL*i,j);

        /*
        ll aa=ans;
        REP(x,mi+1){
            if(x+(i-x)+(j-x)>n)continue;

            ll pat = ncr(n,x);
            pat %= MOD;
            pat *= ncr(n-x,i-x);
            pat %= MOD;
            pat *= ncr(n-x-(i-x),j-x);
            pat %= MOD;
            ans += pat;
            dump(pat);
            ans %= MOD;
        }
        */

        if(i>n||j>n)continue;

        ll pat = ncr(n,i);
        pat *= ncr(n,j);
        pat %= MOD;
        ans += pat;
        ans %= MOD;
    }
    COUT(ans);

    return 0;
}

Measured memory_bytes: 9600