#include <bits/stdc++.h>
using namespace std;
double g[60][6000 + 10];
int n, r, f[6000 + 10], s[6000 + 10], p[6000 + 10];
int ch(double x) {
  for (int i = 0; i <= n + 1; i++)
    for (int j = 0; j <= 6000; j++) g[i][j] = x;
  for (int i = 0; i <= r; i++) g[n + 1][i] = 0;
  for (int i = n; i >= 1; i--)
    for (int j = 0; j <= r; j++) {
      double tf = (g[i + 1][j + f[i]] + f[i]) * p[i] / 100;
      double ts = (g[i + 1][j + s[i]] + s[i]) * (1.0 - 1.0 * p[i] / 100);
      g[i][j] = min(g[i][j], ts + tf);
    }
  return g[1][0] < x;
}
int main() {
  cin >> n >> r;
  for (int i = 1; i <= n; i++) cin >> f[i] >> s[i] >> p[i];
  double L = 0, R = 1e9;
  for (int i = 1; i <= 100; i++) {
    double mid = (L + R) / 2;
    if (ch(mid))
      R = mid;
    else
      L = mid;
  }
  printf("%.15f", L);
}
