#include <iostream>
#include <algorithm>
using namespace std;

void solve() {
    int a, b, c, x;
    cin >> a >> b >> c >> x;
    
    // Calculate the least common multiple (LCM) of a, b, and c
    int l = lcm(a, lcm(b, c));
    
    // If LCM is greater than or equal to X, no valid multiple exists
    if (l >= x) {
        cout << -1 << endl;
        return;
    }
    
    // Find the greatest multiple of `l` that is strictly less than `X`
    int k = (x - 1) / l;
    int ans = k * l;
    
    cout << ans << endl;
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}