#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int T[2][5];
double dp[2][2][201];
int main() {
  for (int i = 0; i < 2; i++)
    for (int j = 0; j < 5; j++) gn(T[i][j]);
  if (T[1][4] == 100 && T[0][4] < 100)
    return puts("1"), 0;
  else if (T[0][4] == 100)
    return puts("0"), 0;
  double p[] = {(100 - T[0][4]) / 100.0 / (T[0][3] - T[0][2] + 1),
                (100 - T[1][4]) / 100.0 / (T[1][3] - T[1][2] + 1)};
  double q[] = {T[0][4] / 100.0, T[1][4] / 100.0};
  int f0 = 0, f1 = 0;
  dp[0][0][T[1][0]] = 1;
  dp[1][0][T[0][0]] = 1;
  double ans = 0;
  int jj = 0;
  for (int i = 1; i < 200000; i++) {
    f0 ^= 1;
    for (int j = T[1][0]; j >= 0; j--) dp[0][f0][j] = 0;
    for (int j = T[1][0]; j > 0; j--)
      if (fabs(dp[0][f0 ^ 1][j]) > 1e-9) {
        for (int k = T[0][2]; k <= T[0][3]; k++) {
          dp[0][f0][max(j - k, 0)] += dp[0][f0 ^ 1][j] * p[0];
        }
        dp[0][f0][j] += dp[0][f0 ^ 1][j] * q[0];
      }
    int jjj = T[0][1] * (i - 1) / T[1][1] + 1;
    if (jjj > 200000) break;
    while (jj < jjj) {
      f1 ^= 1;
      jj++;
      for (int j = T[0][0]; j >= 0; j--) dp[1][f1][j] = 0;
      for (int j = T[0][0]; j > 0; j--)
        if (fabs(dp[1][f1 ^ 1][j]) > 1e-9) {
          for (int k = T[1][2]; k <= T[1][3]; k++) {
            dp[1][f1][max(j - k, 0)] += dp[1][f1 ^ 1][j] * p[1];
          }
          dp[1][f1][j] += dp[1][f1 ^ 1][j] * q[1];
        }
    }
    for (int k = (T[0][1] * (i - 1) != T[1][1] * (jjj - 1)); k <= T[0][0];
         k++) {
      ans += dp[0][f0][0] * dp[1][f1][k];
    }
  }
  printf("%.12lf\n", ans);
  return 0;
}
