#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 55;
const int MAX_R = MAX_N * 105;
const double eps = 1e-10;
int N, R;
int f[MAX_N], s[MAX_N], p[MAX_N];
double dp[MAX_N][MAX_R];
bool check(double mid) {
  for (int i = N - 1; i >= 0; --i) {
    for (int j = R + 1; j < MAX_R; ++j) {
      dp[i + 1][j] = mid;
    }
    for (int j = 0; j <= R; ++j) {
      double t1 = (dp[i + 1][j + f[i]] + f[i]) * p[i] / 100.0;
      double t2 = (dp[i + 1][j + s[i]] + s[i]) * (100 - p[i]) / 100.0;
      dp[i][j] = min(mid, t1 + t2);
    }
  }
  return dp[0][0] - mid < -eps;
}
double bs(double l, double r) {
  for (int i = 0; i < 100; ++i) {
    double mid = (l + r) / 2.0;
    if (check(mid))
      r = mid;
    else
      l = mid;
  }
  return l;
}
void solve() {
  double ans = bs(0.0, 5000000000.);
  printf("%.10f\n", ans);
}
int main() {
  scanf("%d%d", &N, &R);
  for (int i = 0; i < N; ++i) {
    scanf("%d%d%d", &f[i], &s[i], &p[i]);
  }
  solve();
  return 0;
}
