#include <bits/stdc++.h>
using namespace std;
const double inf = 1e20;
const int MX = 55;
const int MM = 5500;
double f[MX][MM];
int a[MX], b[MX], p[MX];
int n, R;
bool ok(double mid) {
  for (int i = n - 1; i >= 0; i--) {
    for (int j = R + 1; j < MM; j++) f[i + 1][j] = mid;
    for (int j = 0; j <= R; j++) {
      double t1 = (f[i + 1][j + a[i]] + a[i]) * p[i] / 100;
      double t2 = (f[i + 1][j + b[i]] + b[i]) * (100 - p[i]) / 100;
      f[i][j] = min(mid, t1 + t2);
    }
  }
  return f[0][0] < mid;
}
int main() {
  scanf("%d%d", &n, &R);
  for (int i = 0; i < n; i++) scanf("%d%d%d", &a[i], &b[i], &p[i]);
  double l = 0, r = 1e10;
  for (int T = 1; T <= 100; T++) {
    double mid = (l + r) / 2;
    if (ok(mid))
      r = mid;
    else
      l = mid;
  }
  printf("%.10f\n", l);
  return 0;
}
