#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(),(x).end()
#define inf 1e18
#define mod 1000000007

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<llint, llint> P;

llint gcd(llint a, llint b)
{
	if(b == 0) return a;
	return gcd(b, a%b);
}

//ax+by = gcd(a, b)を満たす(x, y)を求めgcd(a, b)を返す
llint extgcd(llint a, llint b, llint &x, llint &y)
{
	if(b == 0){
		x = 1, y = 0;
		return a;
	}
	llint xx, yy;
	llint d = extgcd(b, a%b, xx, yy);
	x = yy, y = xx-(a/b)*yy;
	return d;
}

ll T;
ll a[3], g;

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> T;
	while(T--){
		cin >> a[0] >> a[1] >> a[2] >> g;
		sort(a, a+3);
		
		ll A = a[0], B = a[1], x, y;
		ll d = extgcd(A, B, x, y), l = A*B/d;
		x = ((x%l)+l)%l;
		
		ll ans = 0;
		for(llint i = 0; ; i++){
			ll rem = g - i * a[2];
			if(rem < 0) break;
			
			//cout << i << " " << rem << endl;
			
			if(rem % d) continue;
			ll X = (rem / d) % l * x % l;
			if(rem >= A*X%l) ans += (rem - A*X%l) / l + 1, ans %= mod;
		}
		cout << ans << endl;
	}
	
	return 0;
}