Problem: Esports is a form of competitive sports using video games. Dota 2 is one of the most popular competitive video games in Esports. Recently, a new video game Dota 3 was released. In Dota 3 a player can buy some relics for their hero. Relics are counters that track hero's actions and statistics in a game.

Gloria likes to play Dota 3, so she wants to buy all n available relics for her favorite hero.

Relics can be bought using an in-game currency called shards. Each relic has its own price — c_i shards for the i-th relic. A player can buy a relic using one of the following options: 

  * Pay c_i shards to buy the i-th relic; 
  * Pay x shards and randomly get one of all n relics. The probability of getting a relic is the same for all n relics. If a duplicate relic is received, then the relic is recycled and x/2 shards are given back to the player. 



Gloria wants to buy all n relics. Help her minimize the expected number of shards she spends to buy all the relics.

Input

The first line contains two integers n and x (1 ≤ n ≤ 100; 1 ≤ x ≤ 10 000) — the number of relics and the cost to receive a random relic.

The second line consists of n integers c_1, c_2, …, c_n (x ≤ c_i ≤ 10 000; ∑{c_i} ≤ 10 000) — the prices of n relics.

Output

Print a single real number — the minimum expected number of shards that Gloria must spend to buy all the relics.

The absolute or relative error should not exceed 10^{-9}.

Examples

Input


2 20
25 100


Output


47.50000000000000000


Input


4 30
60 50 60 80


Output


171.25000000000000000

Note

In the first example, the optimal strategy is to randomly get one of the two relics paying 20 shards. Then there are two scenarios. 

The first one happens if Gloria receives the first relic. Then she keeps getting random relics until she obtains the second relic. The expected number of shards to spend in this scenario is 20 + 30 = 50.

In the second scenario, Gloria initially gets the second relic. Then it is better to buy the first relic for 25 shards, so the expected number of shards to spend in this scenario is 20 + 25 = 45.

Thus, the expected number of shards to spend is (50 + 45)/(2) = 47.5.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using llf = long double;
struct lint {
  uint64_t a, b;
  lint() : a(0), b(0) {}
  lint(uint64_t val) : a(val), b(0) {}
  lint operator-(const lint& other) const {
    lint result;
    result.a = a - other.a;
    result.b = b - other.b - (result.a > a ? 1 : 0);
    return result;
  }
  lint operator+(const lint& other) const {
    lint result;
    result.a = a + other.a;
    result.b = b + other.b + (result.a < a ? 1 : 0);
    return result;
  }
  lint& operator+=(const lint& other) {
    lint tmp = *this + other;
    *this = tmp;
    return *this;
  }
  lint& operator-=(const lint& other) {
    lint tmp = *this - other;
    *this = tmp;
    return *this;
  }
  long double approx() {
    long double v = a;
    long double w = b;
    w *= (LLONG_MAX + (long double)1.0) * 2;
    return v + w;
  }
};
const int MAXN = 105;
const int MAXS = 10005;
int n, x;
int a[MAXN];
lint bino[MAXN][MAXN];
lint sum[MAXN][MAXS];
void solve() {
  cin >> n;
  cin >> x;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i <= n; i++) {
    bino[i][0] = n;
    for (int j = 1; j <= i; j++) {
      bino[i][j] = bino[i - 1][j] + bino[i - 1][j - 1];
    }
  }
  llf ret = 0;
  sum[0][0] = 1;
  int tot = 0, cnt = 0;
  for (int j = 0; j < n; j++) {
    for (int k = cnt; k >= 0; k--) {
      for (int l = tot; l >= 0; l--) {
        sum[k + 1][l + a[j]] += sum[k][l];
      }
    }
    tot += a[j];
    cnt += 1;
  }
  for (int i = 0; i < n; i++) {
    for (int k = 0; k < n; k++) {
      for (int l = 0; l <= tot - a[i]; l++) {
        sum[k + 1][l + a[i]] -= sum[k][l];
      }
    }
    for (int j = 0; j < n; j++) {
      for (int k = 0; k <= tot - a[i]; k++) {
        lint p = sum[j][k];
        lint q = bino[n - 1][j];
        llf cost = a[i];
        if (k + a[i] >= 1.0 * x * (n + j + 1) / 2) {
          cost = x / 2.0 + x * n / ((j + 1) * 2.0);
        }
        ret += cost * p.approx() / q.approx();
      }
    }
    for (int k = n - 1; k >= 0; k--) {
      for (int l = tot - a[i]; l >= 0; l--) {
        sum[k + 1][l + a[i]] += sum[k][l];
      }
    }
  }
  printf("%.30f\n", (double)ret);
}
int main() { solve(); }