#include <bits/stdc++.h>
using namespace std;
double f(long x, double Q, double R, int remain, double p)
{
  double a = (remain - x) * (Q - (1.0 - p) * R);  // もみ消す
  double b = Q * ((1.0 - pow(p, x)) / (1.0 - p)); // クビになる(ゼロ除算に注意)
  return a + b;
}
double g(long x, double Q, double R, long remain, double p)
{
  double a = -Q + (1 - p) * R;
  double b = Q * pow(p, x);
  return a + b;
}
double h(long t, long N, double X, double Y, double P, double Q, double R)
{
  long skill = X + t * Y;
    double p = 1.0 - 1.0 / skill;
    long remain = N - t;
    if (skill == 1) {  // 必ず卵をかけてしまう場合
        if (remain == 1) {
            return P * t + Q;
        } else {
            return P * t + (Q - R) * (remain - 1) + Q;
        }
    }
    double u = 0;
    if ((1.0 - p) * R >= Q) {
    	u = remain;
    } else {
    	u = min(remain, max(0L, long(log(1.0 - (1 - p) * R / Q) / log(p) - 1e-10 + 1.0)));
    }
    return P * t + f(u, Q, R, remain, p);
}
int main(void)
{
  auto solve = []()
  {
    long N, X, Y;
    cin >> N >> X >> Y;
    double P, Q, R;
    cin >> P >> Q >> R;
    long l = 0, r = N;
    while (r - l > 3)
    {
      long m1 = l + (r - l) / 3;
      long m2 = r - (r - l) / 3;
      double v1 = h(m1, N, X, Y, P, Q, R);
      double v2 = h(m2, N, X, Y, P, Q, R);
      if (v1 < v2)
      {
        l = m1;
      }
      else
      {
        r = m2;
      }
    }
    double ans = 0;
    for (long t = l; t <= r; ++t)
    {
      ans = max(ans, h(t, N, X, Y, P, Q, R));
    }
    cout << fixed << setprecision(10) << ans << endl;
  };
  int T;
  cin >> T;
  for (int i = 0; i < T; i++)
  {
    solve();
  }
}