#include <bits/stdc++.h>
using namespace std;
double f[2][4010][210], p[2], ans;
int hp[2], dt[2], L[2], R[2], P[2], n, x;
int main() {
  for (int i = 0; i < 2; i++)
    scanf("%d%d%d%d%d", &hp[i], &dt[i], &L[i], &R[i], &P[i]);
  if (P[0] == 100) {
    puts("0");
    return 0;
  }
  if (P[1] == 100) {
    puts("1");
    return 0;
  }
  f[0][0][hp[0]] = f[1][0][hp[1]] = 1;
  p[0] = P[0] / 100.0;
  p[1] = P[1] / 100.0;
  for (x = 1; x <= 4000; x++) {
    for (int i = 0; i < 2; i++)
      for (int l = i ^ 1, j = 1; j <= hp[i]; j++) {
        if (f[i][x - 1][j] <= 1e-8) continue;
        for (int k = L[l]; k <= R[l]; k++)
          f[i][x][max(0, j - k)] +=
              f[i][x - 1][j] * (1 - p[l]) / (R[l] - L[l] + 1);
        f[i][x][j] += f[i][x - 1][j] * p[l];
      }
    f[0][x][0] += f[0][x - 1][0];
  }
  for (int i = 1; i <= x; i++) {
    int T = ((i - 1) * dt[0] + dt[1] - 1) / dt[1];
    if (T > x) break;
    ans += (1 - f[0][T][0]) * f[1][i][0];
  }
  printf("%.6lf\n", ans);
  return 0;
}
