#include <bits/stdc++.h>
using namespace std;
int a[51], b[51], c[51], n, r;
double f[52][5011];
inline bool pd(double x) {
  for (int i = n; i; i--) {
    for (int j = r + 1; j <= 5000; j++) f[i + 1][j] = x;
    for (int j = 0; j <= r; j++)
      f[i][j] =
          min(x, (f[i + 1][j + a[i]] + a[i]) * (1.0 * c[i] / 100.0) +
                     (f[i + 1][j + b[i]] + b[i]) * (1.0 - 1.0 * c[i] / 100.0));
  }
  return f[1][0] < x;
}
int main() {
  scanf("%d%d", &n, &r);
  for (int i = 1; i <= n; i++) scanf("%d%d%d", &a[i], &b[i], &c[i]);
  double ll = 0.0, rr = 1e9;
  while (ll + 1e-10 < rr) {
    double mid = (ll + rr) / 2;
    if (pd(mid))
      rr = mid;
    else
      ll = mid;
  }
  printf("%.9f", ll);
  return 0;
}
