#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll inv(ll a, ll m){
    ll b=m, x=1, y=0;
    while(b>0){
        ll t=a/b;
        swap(a-=t*b, b);
        swap(x-=t*y, y);
    }
    return (x%m+m)%m;
}
int main()
{
    int t; cin>>t;
    while(t--){
        ll a[3], y; cin>>a[0]>>a[1]>>a[2]>>y;
        sort(a, a+3);
        ll ans=0;
        ll g=gcd(a[0], a[1]);
        a[0]/=g, a[1]/=g;
        ll b0=inv(a[0], a[1]);
        for(ll i=0; i<=y/a[2]; i++){
            ll y1=y-a[2]*i;
            if(y1%g!=0) continue;
            y1/=g;
            if(a[1]==1){
                ans+=y1+1;
                continue;
            }
            ll p0=b0*y1%a[1];
            if(a[0]*p0>y1) continue;
            ll p1=(y1-a[0]*p0)/a[1];
            ans+=p1/a[0]+1;
        }
        const ll MOD=1e9+7;
        cout<<ans%MOD<<endl;

    }
    return 0;
}