#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 19;
const double H = 3e5;
int Ahp, Al, Ar, Adt, Ap;
int Bhp, Bl, Br, Bdt, Bp;
const int N = 10000;
const int K = 21;
const int HP = 202;
double dp1[N][K];
double dpDamage[K][HP];
double probKill[K];
vector<double> calcDp(int hp, int dt, int l, int r, int p) {
  memset(dp1, 0, sizeof(dp1));
  dp1[0][0] = 1;
  double prob = (100 - p) / 100.0;
  for (int i = 0; i < N - 1; i++)
    for (int j = 0; j < K; j++) {
      dp1[i + 1][min(j + 1, K - 1)] += prob * dp1[i][j];
      dp1[i + 1][j] += (1 - prob) * dp1[i][j];
    }
  memset(dpDamage, 0, sizeof(dpDamage));
  dpDamage[0][0] = 1;
  for (int i = 0; i < K - 1; i++) {
    for (int j = 0; j <= hp; j++) {
      double cof = 1.0 / (r - l + 1);
      for (int t = l; t <= r; t++) {
        dpDamage[i + 1][min(j + t, hp)] += dpDamage[i][j] * cof;
      }
    }
  }
  for (int i = 0; i < K; i++) {
    probKill[i] = dpDamage[i][hp];
    assert(probKill[i] <= 1 + 1e-9);
  }
  double pref = 0;
  vector<double> res(H);
  for (int i = 1; i < N; i++) {
    double sum = 0;
    for (int j = 0; j < K; j++) {
      sum += probKill[j] * dp1[i][j];
    }
    assert(sum - pref >= -1e-9);
    res[(i - 1) * dt] = sum - pref;
    pref = sum;
  }
  return res;
}
void read() {
  cin >> Ahp >> Adt >> Al >> Ar >> Ap;
  cin >> Bhp >> Bdt >> Bl >> Br >> Bp;
}
void solve() {
  auto r2 = calcDp(Ahp, Bdt, Bl, Br, Bp);
  auto r1 = calcDp(Bhp, Adt, Al, Ar, Ap);
  double sum = 0;
  double res = 0;
  for (int i = 0; i < H; i++) {
    res += r1[i] * (1 - sum);
    sum += r2[i];
  }
  printf("%.17f\n", res);
}
int rnd(int l, int r) { return rand() % (r - l + 1) + l; }
void genTest() {
  Ahp = rnd(10, 200);
  Bhp = rnd(10, 200);
  Adt = rnd(1, 30);
  Bdt = rnd(1, 30);
  Al = rnd(10, 100);
  Ar = rnd(10, 100);
  if (Ar < Al) swap(Al, Ar);
  Bl = rnd(10, 100);
  Br = rnd(10, 100);
  if (Br < Bl) swap(Bl, Br);
  Ap = rnd(0, 100);
  Bp = rnd(0, 100);
}
void stress() {
  for (int tt = 0;; tt++) {
    cerr << "tt"
         << " = " << tt << endl;
    genTest();
    solve();
  }
}
int main() {
  if (1) {
    read();
    solve();
  } else {
    stress();
  }
  return 0;
}
