#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-7;
int n, m, A[5555], B[5555], C[5555], P[5555], Asum, Bsum;
double F[55][5555];
bool Get(double mid) {
  int i, j;
  for (i = 0; i <= n; i++) fill(F[i], F[i] + 5555, mid);
  for (i = 0; i <= m; i++) F[n][i] = 0;
  for (i = n - 1; i >= 0; i--)
    for (j = m - A[i + 1]; j >= 0; j--) {
      F[i][j] =
          1.0 * P[i + 1] / 100.0 * (F[i + 1][j + A[i + 1]] + A[i + 1]) +
          (100.0 - P[i + 1]) / 100.0 * (F[i + 1][j + B[i + 1]] + B[i + 1]);
      if (F[i][j] > mid) F[i][j] = mid;
    }
  return F[0][0] < mid;
}
double EF(double l, double r) {
  while (r - l > eps) {
    double mid = (l + r) / 2;
    if (Get(mid))
      r = mid;
    else
      l = mid;
  }
  return r;
}
int main() {
  int i, j, k, x, y;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i++)
    scanf("%d%d%d", &A[i], &B[i], &P[i]), Asum += A[i], Bsum += B[i];
  printf("%.7lf", EF(0, 1e9));
}
