#include <bits/stdc++.h>
using namespace std;
double dp[51][5101];
int fast[51] = {0}, slow[51] = {0}, prob[51] = {0};
bool solve(double mid, int N, int S) {
  for (int i = N - 1; i >= 0; i--) {
    for (int j = 0; j <= S; j++) {
      double sum = 0;
      if (j + fast[i] <= S)
        sum += (dp[i + 1][j + fast[i]] + fast[i]) * prob[i] / 100.0;
      else
        sum += (mid + fast[i]) * prob[i] / 100.0;
      if (j + slow[i] <= S)
        sum += (dp[i + 1][j + slow[i]] + slow[i]) * (1 - prob[i] / 100.0);
      else
        sum += (mid + slow[i]) * (1 - prob[i] / 100.0);
      dp[i][j] = min(mid, sum);
    }
  }
  return dp[0][0] < mid;
}
int main() {
  int N, S;
  scanf("%d%d", &N, &S);
  for (int i = 0; i < N; i++) scanf("%d%d%d", &fast[i], &slow[i], &prob[i]);
  double r = 1E10;
  double l = 0;
  for (int i = 0; i < 100; i++) {
    double mid = (r + l) / 2.0;
    if (solve(mid, N, S))
      r = mid;
    else
      l = mid;
  }
  printf("%.10f\n", dp[0][0]);
}
