#include <bits/stdc++.h>
using namespace std;
long long n, r;
vector<vector<long long> > v;
long double solve() {
  vector<vector<long double> > dp(n + 1, vector<long double>(r + 1, 0.l));
  long double lo = 0, hi = (1e20), mid, eps = 1e-11;
  while ((hi - lo) > eps) {
    mid = (lo + hi) / 2.l;
    for (int i = n - 1; i >= 0; i--) {
      for (int j = r; j >= 0; j--) {
        if (v[i][0] + j <= r) {
          dp[i][j] = (dp[i + 1][v[i][0] + j] + v[i][0]) * (v[i][2] / 100.l);
          if (v[i][1] + j <= r)
            dp[i][j] +=
                (dp[i + 1][v[i][1] + j] + v[i][1]) * (1.l - (v[i][2] / 100.l));
          else
            dp[i][j] += (v[i][1] + mid) * (1.l - (v[i][2] / 100.l));
        } else
          dp[i][j] = mid;
        dp[i][j] = min(mid, dp[i][j]);
      }
    }
    if (dp[0][0] == mid)
      lo = mid;
    else
      hi = mid;
  }
  return mid;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> r;
  v.assign(n, vector<long long>(3, 0));
  for (int i = 0; i < n; i++) cin >> v[i][0] >> v[i][1] >> v[i][2];
  cout << fixed << setprecision(10) << solve();
  return 0;
}
