#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long gcd(long long a, long long b){
  if (b == 0){
    return a;
  } else {
    return gcd(b, a % b);
  }
}
int main(){
  int T;
  cin >> T;
  for (int i = 0; i < T; i++){
    int N, K, H;
    long long Y;
    cin >> N >> K >> H >> Y;
    vector<long long> A = {N, K, H};
    sort(A.begin(), A.end(), greater<int>());
    long long g = gcd(A[1], A[2]);
    A[1] /= g;
    A[2] /= g;
    vector<long long> M(A[2]);
    for (int j = 0; j < A[2]; j++){
      long long p = A[1] * j;
      M[p % A[2]] = p;
    }
    long long ans = 0;
    for (long long r = Y; r >= 0; r -= A[0]){
      if (r % g == 0){
        long long r2 = r / g;
        ans += r2 / (A[1] * A[2]);
        r2 %= A[1] * A[2];
        if (r2 >= M[r2 % A[2]]){
          ans++;
        }
      }
      ans %= MOD;
    }
    cout << ans << endl;
  }
}