#include <bits/stdc++.h>
using namespace std;
int n, m;
double f[100][5000];
int a[1000], b[1000], p[5000];
int check(double x) {
  for (int i = 1; i <= n; i++)
    for (int j = m + 1; j < 5000; j++) f[i][j] = x;
  for (int i = n - 1; i >= 0; i--)
    for (int j = 0; j <= m; j++)
      f[i][j] = min(x, (f[i + 1][j + a[i]] + a[i]) * p[i] / 100 +
                           (f[i + 1][j + b[i]] + b[i]) * (100 - p[i]) / 100);
  return f[0][0] < x;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d%d%d", &a[i], &b[i], &p[i]);
  double l = 0.0, r = 100000000.0, mid = 50000000.0;
  for (int i = 1; i <= 100; i++) {
    if (check(mid))
      r = mid;
    else
      l = mid;
    mid = (l + r) / 2;
  }
  printf("%.10lf", r);
}
