Problem: Pasha decided to invite his friends to a tea party. For that occasion, he has a large teapot with the capacity of w milliliters and 2n tea cups, each cup is for one of Pasha's friends. The i-th cup can hold at most ai milliliters of water.

It turned out that among Pasha's friends there are exactly n boys and exactly n girls and all of them are going to come to the tea party. To please everyone, Pasha decided to pour the water for the tea as follows:

  * Pasha can boil the teapot exactly once by pouring there at most w milliliters of water; 
  * Pasha pours the same amount of water to each girl; 
  * Pasha pours the same amount of water to each boy; 
  * if each girl gets x milliliters of water, then each boy gets 2x milliliters of water. 



In the other words, each boy should get two times more water than each girl does.

Pasha is very kind and polite, so he wants to maximize the total amount of the water that he pours to his friends. Your task is to help him and determine the optimum distribution of cups between Pasha's friends.

Input

The first line of the input contains two integers, n and w (1 ≤ n ≤ 105, 1 ≤ w ≤ 109) — the number of Pasha's friends that are boys (equal to the number of Pasha's friends that are girls) and the capacity of Pasha's teapot in milliliters.

The second line of the input contains the sequence of integers ai (1 ≤ ai ≤ 109, 1 ≤ i ≤ 2n) — the capacities of Pasha's tea cups in milliliters.

Output

Print a single real number — the maximum total amount of water in milliliters that Pasha can pour to his friends without violating the given conditions. Your answer will be considered correct if its absolute or relative error doesn't exceed 10 - 6.

Examples

Input

2 4
1 1 1 1


Output

3

Input

3 18
4 4 4 2 2 2


Output

18

Input

1 5
2 3


Output

4.5

Note

Pasha also has candies that he is going to give to girls but that is another task...

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, w;
  scanf("%d %d", &n, &w);
  std::map<int, int> record;
  int tot = 0, max = -1;
  for (int i = 0; i < (2 * n); i++) {
    int temp;
    scanf("%d", &temp);
    record[temp]++;
    if (temp > max) max = temp;
  }
  int min_n = 0, min_2n = 0;
  for (std::map<int, int>::iterator it = record.begin(); it != record.end();
       ++it) {
    if (tot == 0) min_n = it->first;
    tot += it->second;
    if (tot > n) {
      min_2n = it->first;
      break;
    }
  }
  double max_possible = (double)(w) / (3.0 * (double)n);
  if (max_possible > min_n) {
    max_possible = min_n;
  }
  if (min_2n < (2.0 * max_possible)) {
    max_possible = (double)min_2n / (2.0);
  }
  max_possible *= 3.0;
  max_possible *= (double)n;
  printf("%f\n", max_possible);
  return 0;
}