#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#pragma warning(disable:4996) 

//#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
//const long long MOD = 1000000007;
//const long long MOD = 998244353;
ll MOD;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif

// ax+by=gcd(a,b)を満たす(x, y)を返す
ll extGCD(ll a, ll b, ll &x, ll &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    long long d = extGCD(b, a%b, y, x);
    y -= a / b * x;
    return d;
}

void solve()
{
    ll A, B, C, Y;
    scanf("%lld%lld%lld%lld", &A, &B, &C, &Y);
    if (B < C)swap(B, C);
    if (A < B)swap(A, B);
    ll ans = 0;
    ll i;
    for (i = 0; i <= Y; i += A) {
        ll tmp = Y - i;
        ll x, y;
        ll g = extGCD(B, C, x, y);
        if (tmp%g==0) {
            ll B2 = B/g;
            ll C2 = C/g;
            x *= tmp / g;
            y *= tmp / g;
            if (x < 0) {
                ll t = (-x) / C2 +1;
                x += C2 * t;
                y -= B2 * t;
            }
            if (x >= 0) {
                ll t = x / C2;
                x -= C2 * t;
                y += B2 * t;
            }
            if (y < 0) continue;
            ll ans0 = y / B2 +1;
            ans = (ans + ans0)%MOD;
        }
    }
    printf("%lld\n", ans);
    return;
}

int main()
{
#if 0
    solve();
#else
    int T, t;
    scanf("%d",&T);
    for (t = 0; t < T; t++) {
        //cout << "Case #" << t + 1 << ": ";
        solve();
    }
#endif
    return 0;
}