#include <bits/stdc++.h>

using namespace std;

const long long MOD = 1e9 + 7;

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;
}

long long solve(long long a, long long b, long long c, long long n) {
  long long ret = 0;

  long long x, y;
  long long g = extgcd(a, b, x, y);
  
  for (int i = 0; i * c <= n; i++) {
    long long r = n - i * c;
    if (r == 0)
      ret = (ret + 1) % MOD;
    else if (r % g == 0) {
      long long xt = x * (r / g);
      long long yt = y * (r / g);
      long long l = xt / (b / g);
      xt -= l * (b / g);
      yt += l * (a / g);
      if (xt < 0) {
        xt += b / g;
        yt -= a / g;
      }
      if (yt >= 0) {
        ret += yt / (a / g) + 1;
        ret %= 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[0], v[1], v[2], y) << endl;
  }
  
  return 0;
}