#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

long long extGcd(long long a, long long b, long long &p, long long &q) {  
    if (b == 0) { p = 1; q = 0; return a; }  
    long long d = extGcd(b, a%b, q, p);  
    q -= a/b * p;  
    return d;  
}

int main(){
    ll t;cin >> t;
    while(t--){
        vl v(3);rep(i,3)cin >> v[i];
        sort(all(v));
        ll x;cin >> x;
        ll ans=0;
        rep(i,1000010){
            ll k=x-i*v[2];
            if(k<0)break;
            //v[0]x+v[1]y=kをとく
            if(k%gcd(v[0],v[1]))continue;
            ll g=gcd(v[0],v[1]);
            ll a=v[0]/g,b=v[1]/g;k/=g;
            ll x,y;
            extGcd(a,b,x,y);
            x*=k,y*=k;
            ll l=(x+b*inf*1000)%b;
            ll r=(y+a*inf*1000)%a;
            ll t=(r-y)/a;
            ll nl=-t*b+x;
            if(nl-l>=0){
                ans+=(nl-l)/a+1;
                ans%=MOD;
            }
        }
        cout << ans <<endl;

    }
}