#define ENABLE_DEBUG 1
// hidden common codes{{{
#include<bits/stdc++.h>
#define ALL(v) std::begin(v),std::end(v)
#define LOOP(k) for(lint ngtkana_is_a_genius=0; ngtkana_is_a_genius<(lint)k; ngtkana_is_a_genius++)
using lint=long long;
using ld=long double;
template<class T> using numr=std::numeric_limits<T>;
struct input_t {
    template<class T> operator T() {
        T t;
        std::cin>>t;
        return t;
    }
} input;
#ifdef NGTKANA
#include<debug.hpp>
#else
#define DEBUG(...)(void)0
#endif
/*}}}*/

// mint {{{
template <class ModType> struct modint {
    using value_type = typename ModType::value_type;
    using mint = modint<ModType>;
    static value_type mod() { return ModType::value; }

    static value_type inverse(value_type x) {
        value_type y=1,u=mod(),v=0;
        while(x){
            value_type q=u/x;
            u-=q*x; std::swap(x,u);
            v-=q*y; std::swap(y,v);
        }
        assert(x==0 && std::abs(y)==mod() && std::abs(u)==1 && std::abs(v)<mod());
        return v<0?v+mod():v;
    }

    // the member variable
    value_type value;

    // constructors
    modint()=default;
    modint(modint const&)=default;
    modint(modint&&)=default;
    modint& operator=(modint const&)=default;
    modint& operator=(modint&&)=default;
    ~modint()=default;

    template <class T> modint(T t) : value([t] () mutable {
            if ( t <= -static_cast<T>(mod()) || static_cast<T>(mod()) <= t ) t %= mod();
            return t < 0 ? t + mod() : t;
            }()) {}

    // operators
    mint& operator+= (mint y) {
        value += y.value;
        if (mod() <= value) value -= mod();
        return *this;
    }

    mint& operator-= (mint y) {
        value -= y.value;
        if ( value < 0 ) value += mod();
        return *this;
    }

    mint& operator*= (mint y) {
        value = (long long)value * y.value % mod();
        return *this;
    }

    mint& operator/= (mint y) {
        value = (long long)value * inverse(y.value) % mod();
        return *this;
    }

    mint& operator++() { return *this+=1; }
    mint& operator--() { return *this-=1; }
    mint& operator++(int) { mint this_=*this; *this++; return this_; }
    mint& operator--(int) { mint this_=*this; *this--; return this_; }

    // member functions
    mint& add(mint y) { return *this+=y; }
    mint& sub(mint y) { return *this-=y; }
    mint& mul(mint y) { return *this*=y; }
    mint& div(mint y) { return *this/=y; }
    mint& inv() {
        value = inverse(value);
        return *this;
    }

    mint added(mint y) { mint ans=*this; return ans.add(y); }
    mint subed(mint y) { mint ans=*this; return ans.sub(y); }
    mint muled(mint y) { mint ans=*this; return ans.mul(y); }
    mint dived(mint y) { mint ans=*this; return ans.div(y); }
    mint inved()       { mint ans=*this; return ans.inv(); }

    static mint m1pow(long long y) { return y%2?-1:1; }

    static mint pow(mint x, unsigned long long y) {
        mint ans=1;
        for(;y;y>>=1){
            if(y&1ull) ans*=x;
            x*=x;
        }
        return ans;
    }

    mint& powed(unsigned long long y){
        return *this=pow(*this, y);
    }

    template <class F> mint map(F const& f){
        value=f(value);
        return *this;
    }
};

template <class T> std::ostream& operator<<(std::ostream& os, modint<T> x) { return os << x.value; }

template <class T> modint<T> operator+(modint<T> x, modint<T> y) { return x+=y; }
template <class T> modint<T> operator-(modint<T> x, modint<T> y) { return x-=y; }
template <class T> modint<T> operator*(modint<T> x, modint<T> y) { return x*=y; }
template <class T> modint<T> operator/(modint<T> x, modint<T> y) { return x/=y; }
template <class T> bool operator==(modint<T> x, modint<T> y) { return x.value==y.value; }
template <class T> bool operator!=(modint<T> x, modint<T> y) { return x.value!=y.value; }

template <class T, class U> modint<T> operator+(modint<T> x, U y) { return x+modint<T>(y); }
template <class T, class U> modint<T> operator-(modint<T> x, U y) { return x-modint<T>(y); }
template <class T, class U> modint<T> operator*(modint<T> x, U y) { return x*modint<T>(y); }
template <class T, class U> modint<T> operator/(modint<T> x, U y) { return x/modint<T>(y); }
template <class T, class U> bool operator==(modint<T> x, U y) { return x==modint<T>(y); }
template <class T, class U> bool operator!=(modint<T> x, U y) { return x!=modint<T>(y); }

template <class T, class U> modint<T> operator+(U x, modint<T> y) { return modint<T>(x)+y; }
template <class T, class U> modint<T> operator-(U x, modint<T> y) { return modint<T>(x)-y; }
template <class T, class U> modint<T> operator*(U x, modint<T> y) { return modint<T>(x)*y; }
template <class T, class U> modint<T> operator/(U x, modint<T> y) { return modint<T>(x)/y; }
template <class T, class U> bool operator==(U x, modint<T> y) { return modint<T>(x)==y; }
template <class T, class U> bool operator!=(U x, modint<T> y) { return modint<T>(x)!=y; }

using mod_type = int;
constexpr mod_type mod = 998244353 ;
using mint = modint< std::integral_constant<mod_type, mod> >;
//}}}

// factorials{{{
struct factorials {
    std::vector<mint> fact, finv;

    factorials(std::size_t n) : fact(n, 1), finv(n)
    {
        for(std::size_t i=1;i<n;i++){
            fact.at(i) = fact.at(i-1) * i;
        }

        finv.at(n-1) = fact.at(n-1).inved();
        for(std::size_t i=n-1;i;i--){
            finv.at(i-1) = finv.at(i) * i;
        }
    }

    // member functions
    std::size_t size() const { return fact.size(); }
    std::size_t max() const { return fact.size() - 1; }

    mint at(std::size_t i) const { return fact.at(i); }
    mint inv(std::size_t i) const { return finv.at(i); }

    template <class T, class U>
        auto binom(T n, U k) -> mint
        {
            assert(0<=n);
            if(k<0||n<k)return 0;
            assert(k<=n && static_cast<std::size_t>(n)<size());
            return fact.at(n) * finv.at(k) * finv.at(n-k);
        }

    template <class T, class U>
        auto deal(T n, U k) -> mint
        {
            if(n==0&&k==0)return 1;
            return binom(n+k-1, k-1);
        }
};
/*}}}*/

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

    lint n=input,a=input,b=input,k=input;
    factorials fact(n+1);

    mint ans=0;
    for(lint i=0;i<=n;i++){
        lint j=(k-a*i)/b;
        if (a*i+b*j!=k)continue;
        ans+=fact.binom(n,i)*fact.binom(n,j);
    }
    std::cout<<ans<<'\n';
}


Measured memory_bytes: 2560