#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
int n, R, sum;
int f[55], s[55];
double p[55], g[55][5005];
int ok(double aa) {
  for (int i = n; i >= 1; i--) {
    for (int j = R + 1; j < 5000; ++j) g[i + 1][j] = aa;
    for (int j = 0; j <= R; ++j) {
      g[i][j] = min((g[i + 1][j + f[i]] + f[i]) * p[i] +
                        (g[i + 1][j + s[i]] + s[i]) * (1 - p[i]),
                    aa);
    }
  }
  return g[1][0] < aa;
}
int main() {
  scanf("%d%d", &n, &R);
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d%lf", &f[i], &s[i], &p[i]);
    p[i] /= 100.;
  }
  long double l = 0, r = 1e9;
  while (l + eps < r) {
    long double mid = (l + r) / 2;
    if (ok(mid))
      r = mid;
    else
      l = mid;
  }
  printf("%.10lf", (double)l);
  return 0;
}
