#include <bits/stdc++.h>

using namespace std;

const long long MOD = 1e9 + 7;

// calculate x and y such that ax + by = gcd(a, b).
// the return value is gcd(a, b)
// x and y satisfy |x| <= b and |y| <= a
long long extgcd(long long a, long long b, long long &x, long long &y) {
  long long d = a;
  if (b != 0) {
    d = extgcd(b, a%b, y, x);
    y -= a/b * x;
  } else {
    x = 1;
    y = 0;
  }
  return d;
}

// a * x + b * y = n となる(x, y)の数を求める
long long calc(long long a, long long b, long long n) {
  long long x, y;
  long long g = extgcd(a, b, x, y);
  if (n % g) return 0;
  x *= n / g;
  y *= n / g;

  long long step = x / (b / g);
  x -= step * (b / g);
  y += step * (a / g);

  if (x < 0) {
    x += b / g;
    y -= a / g;
  }

  if (y < 0) return 0;

  long long xl = x;

  step = y / (a / g);
  y -= step * (a / g);
  x += step * (b / g);

  long long xr = x;
  long long ret = (xr - xl) / (b / g) + 1;
  return ret;
}

long long solve(long long n, long long k, long long h, long long y) {
  long long ret = 0;
  for (int i = 0; i * n <= y; i++) {
    long long x = y - i * n;
    if (x == 0)
      ret = (ret + 1) % MOD;
    else
      ret = (ret + calc(k, h, x)) % MOD;
  }
  return ret;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int T;
  cin >> T;
  for (int i = 0; i < T; i++) {
    long long n, k, h, y;
    cin >> n >> k >> h >> y;
    vector<long long> v{n, k, h};
    sort(v.begin(), v.end());
    cout << solve(v[2], v[1], v[0], y) << endl;
  }
  
  return 0;
}