#include <bits/stdc++.h>
using namespace std;
double l, r, f[55][5005];
int n, m, a[55], b[55], p[55];
bool check(double x) {
  for (int i = n - 1; i >= 0; i--) {
    for (int j = m + 1; j <= 5000; j++) {
      f[i + 1][j] = x;
    }
    for (int j = 0; j <= m; j++) {
      f[i][j] = min((f[i + 1][j + a[i]] + a[i]) * p[i] / 100 +
                        (f[i + 1][j + b[i]] + b[i]) * (100 - p[i]) / 100,
                    x);
    }
  }
  return f[0][0] < x;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) {
    scanf("%d%d%d", &a[i], &b[i], &p[i]);
  }
  r = 3920070831;
  while (r - l > 1e-9) {
    if (check((l + r) / 2)) {
      r = (l + r) / 2;
    } else {
      l = (l + r) / 2;
    }
  }
  printf("%.10f\n", r);
  return 0;
}
