#include <bits/stdc++.h>
using namespace std;
void io() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout.precision(15);
}
int n, r;
long double dp[55][5005];
bool vis[55][5005];
long double F[55], S[55], P[55];
const long double EPS = -1e14;
long double solve(int l, int t, long double lim) {
  if (vis[l][t]) return dp[l][t];
  vis[l][t] = 1;
  long double& ret = dp[l][t];
  if (t > r) return (ret = lim);
  if (l > n) return (ret = 0.0);
  ret = P[l] * (F[l] + min(lim, solve(l + 1, t + F[l], lim))) +
        (1.0 - P[l]) * (S[l] + min(lim, solve(l + 1, t + S[l], lim)));
  return ret;
}
int main(int argc, char* argv[]) {
  io();
  cin >> n >> r;
  for (int i = 1; i <= n; i++) {
    cin >> F[i] >> S[i] >> P[i];
    P[i] /= 100.0;
  }
  long double lo = 0.0;
  long double hi = 1e9;
  long double ans = r;
  for (int iter = 0; iter < 100; iter++) {
    long double mid = (lo + hi) / 2.0;
    memset(vis, 0, sizeof(vis));
    long double val = solve(1, 0, mid);
    if (val <= mid) {
      ans = mid;
      hi = mid;
    } else {
      lo = mid;
    }
  }
  cout << ans << '\n';
  return 0;
}
