Problem: Many of you must be familiar with the Google Code Jam round rules. Let us remind you of some key moments that are crucial to solving this problem. During the round, the participants are suggested to solve several problems, each divided into two subproblems: an easy one with small limits (Small input), and a hard one with large limits (Large input). You can submit a solution for Large input only after you've solved the Small input for this problem. There are no other restrictions on the order of solving inputs. In particular, the participant can first solve the Small input, then switch to another problem, and then return to the Large input. Solving each input gives the participant some number of points (usually different for each problem). This takes into account only complete solutions that work correctly on all tests of the input. The participant gets the test result of a Small input right after he submits it, but the test result of a Large input are out only after the round's over. In the final results table the participants are sorted by non-increasing of received points. If the points are equal, the participants are sorted by ascending of time penalty. By the Google Code Jam rules the time penalty is the time when the last correct solution was submitted.

Vasya decided to check out a new tactics on another round. As soon as the round begins, the boy quickly read all the problems and accurately evaluated the time it takes to solve them. Specifically, for each one of the n problems Vasya knows five values:

  * Solving the Small input of the i-th problem gives to the participant scoreSmalli points, and solving the Large input gives scoreLargei more points. That is, the maximum number of points you can get for the i-th problem equals scoreSmalli + scoreLargei.
  * Writing the solution for the Small input of the i-th problem takes exactly timeSmalli minutes for Vasya. Improving this code and turning it into the solution of the Large input takes another timeLargei minutes.
  * Vasya's had much practice, so he solves all Small inputs from the first attempt. But it's not so easy with the Large input: there is the probFaili probability that the solution to the Large input will turn out to be wrong at the end of the round. Please keep in mind that these solutions do not affect the participants' points and the time penalty.



A round lasts for t minutes. The time for reading problems and submitting solutions can be considered to equal zero. Vasya is allowed to submit a solution exactly at the moment when the round ends.

Vasya wants to choose a set of inputs and the order of their solution so as to make the expectation of the total received points maximum possible. If there are multiple ways to do this, he needs to minimize the expectation of the time penalty. Help Vasya to cope with this problem.

Input

The first line contains two integers n and t (1 ≤ n ≤ 1000, 1 ≤ t ≤ 1560). Then follow n lines, each containing 5 numbers: scoreSmalli, scoreLargei, timeSmalli, timeLargei, probFaili (1 ≤ scoreSmalli, scoreLargei ≤ 109, 1 ≤ timeSmalli, timeLargei ≤ 1560, 0 ≤ probFaili ≤ 1).

probFaili are real numbers, given with at most 6 digits after the decimal point. All other numbers in the input are integers.

Output

Print two real numbers — the maximum expectation of the total points and the corresponding minimum possible time penalty expectation. The answer will be considered correct if the absolute or relative error doesn't exceed 10 - 9.

Examples

Input

3 40
10 20 15 4 0.5
4 100 21 1 0.99
1 4 1 1 0.25


Output

24.0 18.875


Input

1 1
100000000 200000000 1 1 0


Output

100000000 1

Note

In the first sample one of the optimal orders of solving problems is:

  1. The Small input of the third problem. 
  2. The Small input of the first problem. 
  3. The Large input of the third problem. 
  4. The Large input of the first problem.



Note that if you solve the Small input of the second problem instead of two inputs of the third one, then total score expectation will be the same but the time penalty expectation will be worse (38).

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b + 1e-16) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
inline void gn(int &x) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), x = 0; c >= '0' && c <= '9';
       c = getchar())
    x = (x << 1) + (x << 3) + c - '0';
  if (sg) x = -x;
}
inline void print(int x) {
  if (x < 0) {
    putchar('-');
    return print(-x);
  }
  if (x < 10) {
    putchar('0' + x);
    return;
  }
  print(x / 10);
  putchar(x % 10 + '0');
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
long double dp[1111][2222], mn[1111][2222];
struct data {
  int ss, sl, ts, tl;
  long double p;
} pro[1111];
bool cmp(data u, data v) {
  return (1000000 - v.p * 1000000) * u.tl * u.p * 1000000 + 1e-16 <
         (1000000 - u.p * 1000000) * v.tl * v.p * 1000000;
}
int main() {
  int n, t;
  cin >> n >> t;
  for (int i = 0; i < 1111; i++)
    for (int j = 0; j < 2222; j++) mn[i][j] = 1e18, dp[i][j] = -1e18;
  for (int i = 0; i < 2222; i++) dp[0][i] = -1e18;
  double tmp;
  for (int i = 1; i <= n; i++)
    scanf("%d %d %d %d %lf", &pro[i].ss, &pro[i].sl, &pro[i].ts, &pro[i].tl,
          &tmp),
        pro[i].p = tmp;
  sort(pro + 1, pro + n + 1, cmp);
  dp[0][0] = 0;
  mn[0][0] = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= t; j++) {
      if (dp[i + 1][j] + 1e-16 < dp[i][j]) {
        dp[i + 1][j] = dp[i][j];
        mn[i + 1][j] = mn[i][j];
      } else if (fabs(dp[i + 1][j] - dp[i][j]) < 1e-16) {
        smin(mn[i + 1][j], mn[i][j]);
      }
      if (j + pro[i + 1].ts <= t) {
        if (dp[i + 1][j + pro[i + 1].ts] + 1e-16 < dp[i][j] + pro[i + 1].ss) {
          dp[i + 1][j + pro[i + 1].ts] = dp[i][j] + pro[i + 1].ss;
          mn[i + 1][j + pro[i + 1].ts] = mn[i][j] + pro[i + 1].ts;
        } else if (fabs(dp[i + 1][j + pro[i + 1].ts] - dp[i][j] -
                        pro[i + 1].ss) < 1e-16) {
          smin(mn[i + 1][j + pro[i + 1].ts], mn[i][j] + pro[i + 1].ts);
        }
      }
      if (j + pro[i + 1].ts + pro[i + 1].tl <= t) {
        if (dp[i + 1][j + pro[i + 1].ts + pro[i + 1].tl] + 1e-16 <
            dp[i][j] + pro[i + 1].ss + pro[i + 1].sl * (1 - pro[i + 1].p)) {
          dp[i + 1][j + pro[i + 1].ts + pro[i + 1].tl] =
              dp[i][j] + pro[i + 1].ss + pro[i + 1].sl * (1 - pro[i + 1].p);
          mn[i + 1][j + pro[i + 1].ts + pro[i + 1].tl] =
              (pro[i + 1].ts + mn[i][j]) * pro[i + 1].p +
              (1 - pro[i + 1].p) * (j + pro[i + 1].ts + pro[i + 1].tl);
        } else if (fabs(dp[i + 1][j + pro[i + 1].ts + pro[i + 1].tl] -
                        dp[i][j] - pro[i + 1].ss -
                        pro[i + 1].sl * (1 - pro[i + 1].p)) < 1e-16) {
          smin(mn[i + 1][j + pro[i + 1].ts + pro[i + 1].tl],
               (pro[i + 1].ts + mn[i][j]) * pro[i + 1].p +
                   (1 - pro[i + 1].p) * (j + pro[i + 1].ts + pro[i + 1].tl));
        }
      }
    }
  }
  long double ans = -1, penal = 1e18;
  for (int i = 0; i <= t; i++) {
    if (ans + 1e-16 < dp[n][i]) {
      ans = dp[n][i];
      penal = mn[n][i];
    } else if (fabs(ans - dp[n][i]) < 1e-16) {
      smin(penal, mn[n][i]);
    }
  }
  printf("%.10lf %.10lf\n", (double)ans, (double)penal);
}