#include <bits/stdc++.h>
using namespace std;
template <class T>
ostream& operator<<(ostream& os, vector<T> V) {
  os << "[ ";
  for (auto v : V) os << v << " ";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> S) {
  os << "{ ";
  for (auto s : S) os << s << " ";
  return os << "}";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
template <class L, class R>
ostream& operator<<(ostream& os, map<L, R> M) {
  os << "{ ";
  for (auto m : M) os << "(" << m.F << ":" << m.S << ")";
  return os << "}";
}
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
const int N = 55;
const int T = 5005;
const long double EPS = 1e-11;
const long double INF = 1e18;
int A[N];
int n, r;
int first[N], second[N];
long double P[N];
long double dp[N][T];
bool check(long double x) {
  for (int i = 0; i < T; ++i) {
    if (i <= r)
      dp[n][i] = 0;
    else
      dp[n][i] = x;
  }
  for (int i = n - 1; i >= 0; --i) {
    for (int j = 0; j < T; ++j) {
      long double f1 = INF, f2 = INF;
      if (j + first[i + 1] < T)
        f1 = (P[i + 1] * 1.0 / 100) *
             (first[i + 1] + dp[i + 1][j + first[i + 1]]);
      if (j + second[i + 1] < T)
        f2 = ((100.0 - P[i + 1]) / 100) *
             (second[i + 1] + dp[i + 1][j + second[i + 1]]);
      if (i == 0 && j == 0)
        dp[i][j] = f1 + f2;
      else
        dp[i][j] = min(f1 + f2, x);
    }
  }
  if (dp[0][0] > x + EPS)
    return true;
  else
    return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << fixed << setprecision(15);
  cin >> n >> r;
  for (int i = 1; i <= n; ++i) {
    cin >> first[i] >> second[i] >> P[i];
  }
  long double lo = 0, hi = 1e12;
  while (hi - lo > EPS) {
    long double mid = (lo + hi) / 2;
    if (check(mid)) {
      lo = mid;
    } else {
      hi = mid;
    }
  }
  cout << lo << "\n";
  return 0;
}
