#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

template< typename T >
inline T extgcd(T a, T b, T &x, T &y) {
  T d = a;
  if(b != 0) {
    d = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
  } else {
    x = 1;
    y = 0;
  }
  return d;
}

vector<ll> ve(3);

inline void solve(){
    cin>>ve;
    ll y;cin>>y;
    sort(ALL(ve));
    ll a,b,c;
    a=ve[2],b=ve[1],c=ve[0];

    ll res=0;
    for(ll i=0;i<=y;i+=a){
        ll t=y-i;

        // t=j*b+k*cの解の個数
        ll j,k;

        // t=j*u+k*vの解の個数
        ll g=extgcd(b,c,j,k);
        if(t%g) continue;
        ll w=t/g; // t=g*w
        
        // g=j*u+k*v;
        j*=w,k*=w;

        // j=j' + x * v
        // k=k' - x * u

        ll dw=ll(ceil((-j+0.0)/(c+0.0)));
        ll up=ll(floor((k+0.0)/(b+0.0)));
        // cout<<up<<" ~ "<<dw<<endl;
        res+=max(0ll,(up-dw+1));
        if(res>=mod) res-=mod;
    }
    cout<<res<<"\n";
}


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