#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const long long N = 111, M = 5011;
const long long inf = 0x3f3f3f3f3f3f;
long long n, m, a[N + 5], b[N + 5];
double p[N], f[N + 5][M + 5];
namespace IO {
inline long long read() {
  long long x = 0;
  bool f = 0;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar()) f ^= (ch == '-');
  for (; isdigit(ch); ch = getchar()) x = (x << 3) + (x << 1) + (ch ^ 48);
  return f ? -x : x;
}
inline void write(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) write(x / 10);
  putchar(x % 10 | 48);
}
inline void wrn(long long x) {
  write(x);
  putchar(' ');
}
inline void wln(long long x) {
  write(x);
  putchar('\n');
}
inline void wlnn(long long x, long long y) { wrn(x), wln(y); }
}  // namespace IO
using namespace IO;
inline bool Check(double x) {
  for (register int i = (n - 1); i >= (0); --i) {
    for (register int j = (m + 1); j <= (M - 1); ++j) f[i + 1][j] = x;
    for (register int j = (0); j <= (m); ++j)
      f[i][j] = min((f[i + 1][j + a[i]] + a[i]) * p[i] / 100.0 +
                        (f[i + 1][j + b[i]] + b[i]) * (100.0 - p[i]) / 100.0,
                    x);
  }
  return f[0][0] < x;
}
int main() {
  n = read(), m = read();
  for (register int i = (0); i <= (n - 1); ++i)
    a[i] = read(), b[i] = read(), p[i] = read();
  double l = 0, r = 1e9;
  while (r - l > eps) {
    double Mid = (l + r) / 2;
    Check(Mid) ? r = Mid : l = Mid;
  }
  return printf("%.10lf", r), 0;
}
