#include <bits/stdc++.h>
using namespace std;
const int N = 10000;
const double eps = 0.00000001;
int hp[2], cd[2], l[2], r[2];
double d[N][210], rez, prob1[N], prob2[N], p[2];
void sol(int el, int hp) {
  memset(d, 0, sizeof(d));
  int i, j;
  double sum;
  d[0][hp] = 1;
  for (i = 1; i < N; ++i) {
    sum = 0;
    for (j = hp; j; --j) {
      d[i][j] += d[i - 1][j] * p[el];
      if (j + l[el] <= hp) sum += d[i - 1][j + l[el]];
      if (j + r[el] + 1 <= hp) sum -= d[i - 1][j + r[el] + 1];
      d[i][j] += sum * (1.0 - p[el]) / (r[el] - l[el] + 1);
    }
    d[i][0] = 1;
    for (j = 1; j <= hp; ++j) {
      if (d[i][j] < eps) d[i][j] = 0;
      d[i][0] -= d[i][j];
    }
    if (d[i][0] < eps) d[i][0] = 0;
  }
}
int main() {
  int i;
  for (i = 0; i < 2; ++i)
    cin >> hp[i] >> cd[i] >> l[i] >> r[i] >> p[i], p[i] = p[i] / 100;
  if (p[0] == 100) {
    cout << "1";
    return 0;
  }
  if (p[1] == 100) {
    cout << "0";
    return 0;
  }
  sol(0, hp[1]);
  for (i = 1; i < N; ++i) prob1[i] = d[i][0] - d[i - 1][0];
  sol(1, hp[0]);
  for (i = 1; i < N; ++i) prob2[i] = d[i][0];
  for (i = 1; i < N; ++i) {
    int nrb = ((i - 1) * cd[0] - 1) / cd[1] + 1;
    if (i == 1) nrb = 0;
    if (nrb >= N) nrb = N - 1;
    rez += prob1[i] * (1 - prob2[nrb]);
  }
  cout << setprecision(10) << fixed << rez;
  return 0;
}
