#pragma GCC optimize("O3") #include using namespace std; using ll=long long; using P=pair; template using V=vector; #define fi first #define se second #define all(v) (v).begin(),(v).end() const ll inf=(1e18); //const ll mod=998244353; const ll mod=1000000007; const vector dy={-1,0,1,0},dx={0,-1,0,1}; ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;} ll LCM(ll c,ll d){return c/GCD(c,d)*d;} struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout< bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } templatevoid debag(const vector &a){cerr<<"debag :";for(auto v:a)cerr<void print(const vector &a){for(auto v:a)cout< T extgcd(T a,T b,T &x,T &y){ if(b==0){ x=1;y=0; return a; } T d=extgcd(b,a%b,y,x); y-=a/b*x; return d; } void solve(){ V d(3); for(int i=0;i<3;i++)cin>>d[i]; ll n; cin>>n; sort(all(d),greater()); ll g=GCD(d[1],d[2]),v,x,y; extgcd(d[1],d[2],x,y); d[1]/=g;d[2]/=g; ll ans=0; for(ll i=0;i<=1000000;i++){ if(i*d[0]>n)break; v=n-i*d[0]; if(v%g!=0)continue; v/=g; if(y>=0)ans+=y*v/d[1]+(x*v-d[2]+1)/d[2]+1; else ans+=(x*v)/d[2]+(y*v-d[1]+1)/d[1]+1; if(ans>=mod)ans%=mod; } cout<>t; while(t--)solve(); }