#include <bits/stdc++.h>
using namespace std;
const int N = 55;
int n, m, a[N], b[N], p[N];
double f[N][5000];
bool check(double t) {
  for (int i = n - 1; i >= 0; i--) {
    for (int j = m + 1; j < 5000; j++) f[i + 1][j] = t;
    for (int j = 0; j <= m; j++) {
      double x = (f[i + 1][j + a[i]] + a[i]) * p[i] / 100;
      double y = (f[i + 1][j + b[i]] + b[i]) * (100 - p[i]) / 100;
      f[i][j] = min(t, x + y);
    }
  }
  if (f[0][0] < t)
    return 1;
  else
    return 0;
}
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, r = 1e10;
  for (int i = 1; i <= 100; i++) {
    double mid = (l + r) / 2;
    if (check(mid))
      r = mid;
    else
      l = mid;
  }
  printf("%.10lf", l);
  return 0;
}
