#include <bits/stdc++.h>
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9')
    x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
  return x * f;
}
const int N = 51, M = 5001;
const double eps = 1e-9;
int n, m, a[N], b[N], p[N];
double f[N][M];
inline bool check(const double &k) {
  for (register int i = n - 1; ~i; i--) {
    for (register int j = m + 1; j < M; j++) f[i + 1][j] = k;
    for (register int j = 0; j <= m; j++) {
      f[i][j] = std::min((f[i + 1][j + a[i]] + a[i]) * p[i] / 100 +
                             (f[i + 1][j + b[i]] + b[i]) * (100 - p[i]) / 100,
                         k);
    }
  }
  return f[0][0] < k;
}
int main() {
  n = read(), m = read();
  for (register int i = 0; i < n; i++) {
    a[i] = read(), b[i] = read(), p[i] = read();
  }
  double l = 0, r = 1e9;
  while (r - l > eps) {
    const double mid = (l + r) / 2;
    (check(mid) ? r : l) = mid;
  }
  printf("%.10f\n", r);
  return 0;
}
