#include <bits/stdc++.h>
using namespace std;
double ans[2], co[2], r[2][201];
int h[2], d[2], t[2], dl[2], dr[2], p[2];
void update(int k) {
  t[k] += d[k];
  for (int i = 1; i <= h[k ^ 1]; i++)
    if (r[k ^ 1][i] > 1e-9) {
      for (int j = dl[k]; j <= dr[k]; j++)
        r[k ^ 1][max(0, i - j)] += co[k] * r[k ^ 1][i];
      r[k ^ 1][i] *= p[k] * 0.01;
    }
  ans[k] += (1 - r[k][0]) * r[k ^ 1][0];
  if (k == 0) r[1][0] = 0;
}
int main() {
  for (int i = 0; i < 2; i++) cin >> h[i] >> d[i] >> dl[i] >> dr[i] >> p[i];
  if (p[0] == 100) return puts("0") & 1;
  if (p[1] == 100) return puts("1") & 1;
  co[0] = 1.0 / (dr[0] + 1 - dl[0]) * (1 - 0.01 * p[0]);
  co[1] = 1.0 / (dr[1] + 1 - dl[1]) * (1 - 0.01 * p[1]);
  r[0][h[0]] = 1;
  r[1][h[1]] = 1;
  for (int i = 0; i < 9999; i++)
    if (t[0] <= t[1])
      update(0);
    else
      update(1);
  printf("%.9lf\n", ans[0]);
  return 0;
}
