#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

long long extgcd(long long a, long long b, long long& x, long long& y){
    long long g = a;
    if(b != 0){
        g = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    }
    else{
        x = 1, y = 0;
    }
    return g;
}

void solve(){
    vector<ll> N(3);
    ll Y;
    cin >> N[0] >> N[1] >> N[2] >> Y;
    sort(rbegin(N), rend(N));
    ll g = gcd(N[1], N[2]);
    N[1] /= g, N[2] /= g;
    ll ans = 0;
    for(ll i = 0; i <= Y / N[0]; ++i){
        ll X = Y - N[0] * i;
        if(X % g != 0)  continue;
        X /= g;
        ll p, q;
        extgcd(N[1], N[2], p, q);
        ll upper, lower;
        if(q >= 0)  upper = X * q / N[1];
        else    upper = (X * q - (N[1] - 1)) / N[1];
        if(p < 0)   lower = (-X * p + N[2] - 1) / N[2];
        else    lower = -X * p / N[2];
        (ans += upper - lower + 1) %= mod;
    }
    cout << ans << '\n';
}

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

    int T;
    cin >> T;
    while(T--)  solve();

    return 0;
}