#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using db = long double;
const int N = 2e5 + 5, MOD = 1e9 + 7;
using ii = pair<int, int>;
db dp[55][55 * 105];
int F[55], S[55], P[55], n, R;
int sum[55];
bool check(db x) {
  for (int i = R + 1; i <= sum[n]; i++) dp[n + 1][i] = x;
  for (int i = n; i; --i) {
    for (int j = 0; j <= max(sum[i - 1], R); j++)
      if (j > R)
        dp[i][j] = x;
      else
        dp[i][j] =
            min(x, (dp[i + 1][j + F[i]] + F[i]) * P[i] / 100.0 +
                       (dp[i + 1][j + S[i]] + S[i]) * (100 - P[i]) / 100.0);
  }
  return dp[1][0] < x;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> R;
  for (int i = 1; i <= n; i++) {
    cin >> F[i] >> S[i] >> P[i];
    sum[i] = sum[i - 1] + S[i];
  }
  double lo = 0.0, hi = 1e9;
  for (int i = 0; i < 100; i++) {
    db md = (lo + hi) / 2.0;
    if (check(md))
      hi = md;
    else
      lo = md;
  }
  cout << fixed << setprecision(10) << lo << '\n';
  return 0;
}
