#include <bits/stdc++.h>
using namespace std;
const int N = 66, R = 6666;
int a[N], b[N];
double p[N], f[N][R];
int n, t;
bool check(double mid) {
  for (int i = n - 1; i >= 0; i--) {
    for (int j = t + 1; j < R; j++) f[i + 1][j] = mid;
    for (int j = 0; j <= t; j++)
      f[i][j] = min(mid, p[i] * (a[i] + f[i + 1][j + a[i]]) +
                             (1 - p[i]) * (b[i] + f[i + 1][j + b[i]]));
  }
  return f[0][0] < mid;
}
int main() {
  cin >> n >> t;
  for (int i = 0, P; i < n; i++) {
    cin >> a[i] >> b[i] >> P;
    p[i] = P * 0.01;
  }
  double l = 0, r = 1e10, mid;
  for (int i = 1; i <= 500; i++) {
    mid = (l + r) / 2;
    if (check(mid))
      r = mid;
    else
      l = mid;
  }
  printf("%.11lf\n", r);
  return 0;
}
