#include <bits/stdc++.h>
using namespace std;
long long n, m;
double f[60][5100];
long long a[1001], b[1001], p[1001];
bool check(double mid) {
  for (int i = n; i >= 1; i--) {
    for (int t = m + 2; t <= 5010; t++) f[i + 1][t] = mid;
    for (int j = 1; j <= m + 1; j++)
      f[i][j] = min(mid, (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[1][1] < mid;
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i] >> b[i] >> p[i];
  }
  double l = 1, r = 1e9, cnt = 1;
  while (l + 0.000000005 < r) {
    if (cnt > 100) break;
    double mid = (l + r) / 2;
    cnt++;
    if (check(mid))
      r = mid;
    else
      l = mid;
  }
  printf("%.9f", l);
  return 0;
}
