#include <bits/stdc++.h>
using namespace std;
const int MAXN = (52);
const int MAXT = (5142);
const int DEP = 30;
int n, R;
long double f[MAXN], s[MAXN];
long double p[MAXN];
long double need_comp[MAXN];
void read() {
  cin >> n >> R;
  for (int i = 0; i < n; i++) {
    cin >> f[i] >> s[i] >> p[i];
    p[i] /= 100.0;
  }
}
long double dp[MAXN][MAXT], X;
long double rec(int level, int T) {
  if (T > R) return X;
  if (level == n) return 0;
  long double &memo = dp[level][T];
  if (memo != -42) return memo;
  memo = 0;
  memo = p[level] * (f[level] + rec(level + 1, T + f[level]));
  memo += (1.0 - p[level]) * (s[level] + min(X, rec(level + 1, T + s[level])));
  return memo;
}
bool check(long double _X) {
  X = _X;
  for (int i = 0; i < n; i++)
    for (int j = 0; j <= R; j++) dp[i][j] = -42;
  return rec(0, 0) <= X;
}
void solve() {
  long double low = 0, high = 1e17, mid, ret = -1;
  for (int ops = 0; ops < 200; ops++) {
    mid = (low + high) / 2.0;
    if (check(mid))
      ret = mid, high = mid;
    else
      low = mid;
  }
  cout << setprecision(12) << fixed << ret << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  read();
  solve();
  return 0;
}
