#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

template<typename T>
T extgcd(T a, T b, T &x ,T &y){
    for (T u = y = 1, v = x = 0; a; ) {
        ll q = b/a;
        swap(x -= q*u, u);
        swap(y -= q*v, v);
        swap(b -= q*a, a);
    }
    return b;
}

template<class T>T divfloor(T x, T y){
    if((x < 0) != (y < 0)) return (x+y-1)/y;
    else return x/y;
}

template<class T>T divceil(T x, T y){
    if((x < 0) != (y < 0)) return x/y;
    else return (x+y-1)/y;
}

void solve(){
    ll a, b, c, y;
    cin >> a >> b >> c >> y;
    if(a > c) swap(a, c);
    if(b > c) swap(b, c);
    ll ans = 0, g = gcd(a, b);
    a /= g; b /= g;
    for (ll x2 = y; x2 >= 0; x2 -= c) {
        if(x2 % g) continue;
        ll x = x2/g, p, q;
        extgcd(a, b, p, q);
        p *= x; q *= x;
        ans += max(0LL, divfloor(q, a)-divceil(-p, b)+1);
    }
    cout << ans%MOD << "\n";
}

int main() {
    int t;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}