/** * @FileName a.cpp * @Author kanpurin * @Created 2021.01.22 22:45:04 **/ #include "bits/stdc++.h" using namespace std; typedef long long ll; template< int MOD > struct mint { public: long long x; mint(long long x = 0) :x((x%MOD+MOD)%MOD) {} mint(std::string &s) { long long z = 0; for (int i = 0; i < s.size(); i++) { z *= 10; z += s[i] - '0'; z %= MOD; } this->x = z; } mint& operator+=(const mint &a) { if ((x += a.x) >= MOD) x -= MOD; return *this; } mint& operator-=(const mint &a) { if ((x += MOD - a.x) >= MOD) x -= MOD; return *this; } mint& operator*=(const mint &a) { (x *= a.x) %= MOD; return *this; } mint& operator/=(const mint &a) { long long n = MOD - 2; mint u = 1, b = a; while (n > 0) { if (n & 1) { u *= b; } b *= b; n >>= 1; } return *this *= u; } mint operator+(const mint &a) const { mint res(*this); return res += a; } mint operator-() const {return mint() -= *this; } mint operator-(const mint &a) const { mint res(*this); return res -= a; } mint operator*(const mint &a) const { mint res(*this); return res *= a; } mint operator/(const mint &a) const { mint res(*this); return res /= a; } friend std::ostream& operator<<(std::ostream &os, const mint &n) { return os << n.x; } friend std::istream &operator>>(std::istream &is, mint &n) { long long x; is >> x; n = mint(x); return is; } bool operator==(const mint &a) const { return this->x == a.x; } bool operator!=(const mint &a) const { return this->x != a.x; } mint pow(long long k) const { mint ret = 1; mint p = this->x; while (k > 0) { if (k & 1) { ret *= p; } p *= p; k >>= 1; } return ret; } }; constexpr int MOD = 1e9 + 7; // ax + by = gcd(a,b) template 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; } // gcd(a,mod) = 1 ll invMod(ll a, ll mod) { ll x,y; if (extgcd(a,mod,x,y) != 1) { return -1; } return (x % mod + mod) % mod; } int main() { int t;cin >> t; while(t--) { vector a(3); for (int i = 0; i < 3; i++) { cin >> a[i]; } ll y;cin >> y; sort(a.rbegin(), a.rend()); ll g = __gcd(a[1],a[2]); a[1] /= g; a[2] /= g; mint ans = 0; ll pm = invMod(a[1],a[2]); for (int i = 0; i*a[0] <= y; i++) { ll x = y-i*a[0]; if (x % g != 0) continue; x /= g; ll z = pm * x % a[2]; if (z > x/a[1]) continue; ans += (x/a[1]-z)/a[2]+1; } cout << ans << endl; } return 0; }