#include <bits/stdc++.h>
using namespace std;
const int N = 53;
int n, m, a[N], b[N];
long double f[N][N * 104], p[N];
bool check(long double md) {
  int i, j;
  for (i = 0; i <= n; i++)
    for (j = m; j <= m + 100; j++) f[i][j] = md;
  for (i = 0; i <= m; i++) f[n][i] = 0;
  for (i = n; i >= 1; i--)
    for (j = 0; j <= m; j++)
      f[i - 1][j] = min(md, p[i] * (f[i][j + a[i]] + a[i]) +
                                (1.0 - p[i]) * (f[i][j + b[i]] + b[i]));
  return f[0][0] < md;
}
int main() {
  int i, j, k;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i++) {
    scanf("%d%d%d", &a[i], &b[i], &j);
    p[i] = j * 0.01;
  }
  long double lb = 0, rb = 40000000;
  for (i = 1; i <= 80; i++) {
    long double md = (lb + rb) / 2;
    if (check(md))
      rb = md;
    else
      lb = md;
  }
  printf("%.10lf\n", (double)lb);
  return 0;
}
