#include <bits/stdc++.h>
using namespace std;
const int N = 55;
const int M = 5555;
const int INF = 1.01e9;
double dp[N][M];
int main() {
  int n, R;
  scanf("%d%d", &n, &R);
  vector<int> f(n), s(n), p(n);
  vector<int> d(n);
  for (int i = 0; i < (n); i++) {
    scanf("%d%d%d", &f[i], &s[i], &p[i]);
    d[i] = s[i] - f[i];
    R -= f[i];
  }
  auto check = [&](double C) {
    memset(dp, 0, sizeof dp);
    for (int i = n - 1; i >= 0; i--) {
      for (int t = 0; t <= R; t++) {
        double f1 = p[i] / 100.0 * (dp[i + 1][t] + f[i]);
        double f2;
        if (t + d[i] > R) {
          f2 = (100 - p[i]) / 100.0 * (C + s[i]);
        } else {
          f2 = (100 - p[i]) / 100.0 * (dp[i + 1][t + d[i]] + s[i]);
        }
        if (i > 0) {
          dp[i][t] = min(C, f1 + f2);
        } else {
          dp[i][t] = f1 + f2;
        }
      }
    }
    return dp[0][0] > C;
  };
  double l = 0;
  double r = 1e12;
  for (int tt = 0; tt < (80); tt++) {
    if (check((l + r) / 2)) {
      l = (l + r) / 2;
    } else {
      r = (l + r) / 2;
    }
  }
  printf("%.17f\n", l);
  return 0;
}
