#include <bits/stdc++.h>
using namespace std;
double dp1[300], dp2[300];
int dlcmp(double x) {
  if (x < -1e-9) return -1;
  if (fabs(x) < 1e-9) return 0;
  return 1;
}
int main(void) {
  int hp1, hp2, t1, t2, l1, l2, r1, r2;
  double p1, p2, p;
  scanf("%d%d%d%d%lf", &hp1, &t1, &l1, &r1, &p1);
  scanf("%d%d%d%d%lf", &hp2, &t2, &l2, &r2, &p2);
  p1 /= 100, p2 /= 100;
  if (dlcmp(p1 - 1.0) == 0) {
    printf("0.000000\n");
    return 0;
  }
  if (dlcmp(p2 - 1.0) == 0) {
    printf("1.000000\n");
    return 0;
  }
  int nowt1 = 0, nowt2 = 0;
  double ans = 0;
  dp1[hp1] = dp2[hp2] = 1.0;
  for (int i = 1; i <= 50000; i++)
    if (nowt1 <= nowt2) {
      nowt1 += t1;
      p = 1.0 / (r1 - l1 + 1);
      for (int j = 1; j <= hp2; j++)
        if (dp2[j] > 1e-9) {
          for (int k = l1; k <= r1; k++)
            dp2[max(j - k, 0)] += dp2[j] * p * (1.0 - p1);
          dp2[j] *= p1;
        }
      ans += (1 - dp1[0]) * dp2[0];
      dp2[0] = 0;
    } else {
      nowt2 += t2;
      p = 1.0 / (r2 - l2 + 1);
      for (int j = 1; j <= hp1; j++)
        if (dp1[j] > 1e-9) {
          for (int k = l2; k <= r2; k++)
            dp1[max(j - k, 0)] += dp1[j] * p * (1.0 - p2);
          dp1[j] *= p2;
        }
    }
  printf("%.6f\n", ans);
  return 0;
}
