#include <bits/stdc++.h>
using namespace std;
const int maxt = 5000;
const int maxn = 120;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
int n, R, p[maxn], a[maxn], b[maxn];
double f[51][maxt], l, r = 1e9;
bool check(double mid) {
  for (int i = n - 1; i >= 0; i--) {
    for (int j = R + 1; j < maxt; j++) f[i + 1][j] = mid;
    for (int j = 0; j <= R; j++)
      f[i][j] = min(mid, (f[i + 1][j + a[i]] + a[i]) * p[i] / 100 +
                             (f[i + 1][j + b[i]] + b[i]) * (100 - p[i]) / 100);
  }
  return mid > f[0][0];
}
int main() {
  n = read(), R = read();
  for (int i = 0; i < n; i++) a[i] = read(), b[i] = read(), p[i] = read();
  double mid = (l + r) / 2;
  for (int i = 1; i <= 100; i++, mid = (l + r) / 2)
    (check(mid)) ? r = mid : l = mid;
  printf("%.10f\n", l);
  return 0;
}
