#include<iostream>
using namespace std;
using ll = long long;

ll gcd(ll a, ll b) {
    if (b == 0) {
        return a;
    }
    else {
        return gcd(b, a % b);
    }
}
ll extend_gcd(ll a, ll b, ll& x, ll& y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    else {
        long long d = extend_gcd(b, a % b, y, x);
        y -= a / b * x;
        return d;
    }
}


int main() {
	ll N, K, H, Y;
    ll X, G, A, B, S, _, P, Q;
    ll ans = 0;
    ll beta, upper, lower;
	ll mod = 1000000007;

	cin >> N >> K >> H >> Y;

	if (N < K) swap(N, K);
	if (N < H) swap(N, H);
    G = gcd(K, H);

    A = K / G;
    B = H / G;
    _ = extend_gcd(A, B, P, Q);

    for (ll x = 0; x <= Y / N; x++) {
        beta = Y - N * x;
        if (beta % G) {
            continue;
        }

        S = beta / G;
        upper = S * Q / A;
        lower = (-S * P + (B - 1)) / B;

        ans += upper - lower + 1;
        ans %= mod;
    }
    cout << ans << endl;
	return 0;
}