#include<algorithm>
#include<cassert>
#include<iostream>
#include<vector>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef vector<lint>vl;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)

lint gcd(lint x,lint y,lint&a,lint&b){
  if(y==0){
    a=1,b=0;
    return x;
  }
  lint q=x/y;
  lint g=gcd(y,x-q*y,b,a);
  b-=q*a;
  return g;
}

int main(){
  int t;cin>>t;
  while(t--){
    lint y;vl a(3);
    rep(i,3)cin>>a[i];
    cin>>y;
    sort(a.rbegin(),a.rend());
    lint ans=0;
    lint d,e;
    lint g=gcd(a[1],a[2],d,e);
    a[1]/=g;
    a[2]/=g;
    d%=a[2];
    if(d<0)d+=a[2];
    for(lint i=0;i<=y/a[0];i++){
      lint c=y-a[0]*i;
      if(c%g)continue;
      c/=g;
      lint x=d*c%a[2];
      if(c<x*a[1])continue;
      lint f=(c-x*a[1])/a[1]/a[2];
      ans+=f+1;
      ans%=1000000007;
    }
    cout<<ans<<endl;
  }
}