#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
using namespace std;

void solve(int cs) {
  int64_t a, b, c, x;
  cin >> a >> b >> c >> x;
  int64_t L = a / __gcd(a, b) * b;
  L = L / __gcd(L, c) * c;
  if (L > x) cout << -1 << "\n";
  L = x / L * L;
  cout << (L == x ? -1 : L) << "\n"; 
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc = 1;
  cin >> tc;
  for (int cs = 1; cs <= tc; cs++) {
    solve(cs);
  }
  return 0;
}