#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-9;
int N, R, s[55], f[55], top = 0;
long double p[55];
long double dp[55][5005];
bool check(long double x) {
  for (int i = 0; i <= R; i++) dp[N][i] = 0;
  for (int i = R + 1; i <= top; i++) dp[N][i] = x;
  for (int i = N - 1; i >= 0; i--) {
    for (int j = 0; j <= top; j++) {
      dp[i][j] = p[i] * (f[i] + min(x, dp[i + 1][j + f[i]])) +
                 (1.0 - p[i]) * (s[i] + min(x, dp[i + 1][j + s[i]]));
    }
  }
  if (dp[0][0] >= x)
    return true;
  else
    return false;
}
int main(int argc, char const *argv[]) {
  cin >> N >> R;
  for (int i = 0; i < N; i++) {
    cin >> f[i] >> s[i] >> p[i];
    p[i] /= 100.0;
    top += s[i];
  }
  long double le = 0, Ri = 1e9 + 7;
  while (Ri > eps + le) {
    long double mid = (le + Ri) * 0.5;
    if (check(mid)) {
      le = mid;
    } else {
      Ri = mid;
    }
  }
  printf("%.10Lf\n", le);
  return 0;
}
