#include <bits/stdc++.h>
using namespace std;
const int N = 55, B = 5005;
const double eps = 1e-9;
int n, up, a[N], b[N], p[N];
double f[N][B];
inline bool ok(double mid) {
  int i, j;
  for (i = n; i >= 1; i--) {
    for (j = up + 1; j < B; j++) f[i + 1][j] = mid;
    for (j = 0; j <= up; j++) {
      f[i][j] =
          min(mid, (double)1.00 * (f[i + 1][j + a[i]] + a[i]) * p[i] / 100.00 +
                       (double)1.00 * (f[i + 1][j + b[i]] + b[i]) *
                           ((double)100.00 - p[i]) / 100.00);
    }
  }
  return (f[1][0] < mid - eps);
}
int main() {
  int i;
  scanf("%d%d", &n, &up);
  for (i = 1; i <= n; ++i) {
    scanf("%d%d%d", &a[i], &b[i], &p[i]);
  }
  double l = 0.00, r = 1e10, mid;
  for (i = 1; i <= 100; i++) {
    mid = (double)(l + r) * 0.50;
    if (ok(mid))
      r = mid;
    else
      l = mid;
  }
  printf("%.10lf\n", l);
}
