Codeforces Round 333 (Div. 1) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

dp

math

probabilities

*2300

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Kleofáš and the n-thlon

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputKleofáš is participating in an *n*-thlon - a tournament consisting of *n* different competitions in *n* different disciplines (numbered 1 through *n*). There are *m* participants in the *n*-thlon and each of them participates in all competitions.

In each of these *n* competitions, the participants are given ranks from 1 to *m* in such a way that no two participants are given the same rank - in other words, the ranks in each competition form a permutation of numbers from 1 to *m*. The score of a participant in a competition is equal to his/her rank in it.

The overall score of each participant is computed as the sum of that participant's scores in all competitions.

The overall rank of each participant is equal to 1 + *k*, where *k* is the number of participants with strictly smaller overall score.

The *n*-thlon is over now, but the results haven't been published yet. Kleofáš still remembers his ranks in each particular competition; however, he doesn't remember anything about how well the other participants did. Therefore, Kleofáš would like to know his expected overall rank.

All competitors are equally good at each discipline, so all rankings (permutations of ranks of everyone except Kleofáš) in each competition are equiprobable.

Input

The first line of the input contains two space-separated integers *n* (1 ≤ *n* ≤ 100) and *m* (1 ≤ *m* ≤ 1000) — the number of competitions and the number of participants respectively.

Then, *n* lines follow. The *i*-th of them contains one integer *x*_{i} (1 ≤ *x*_{i} ≤ *m*) — the rank of Kleofáš in the *i*-th competition.

Output

Output a single real number – the expected overall rank of Kleofáš. Your answer will be considered correct if its relative or absolute error doesn't exceed 10^{ - 9}.

Namely: let's assume that your answer is *a*, and the answer of the jury is *b*. The checker program will consider your answer correct, if .

Examples

Input

4 10

2

1

2

1

Output

1.0000000000000000

Input

5 5

1

2

3

4

5

Output

2.7500000000000000

Input

3 6

2

4

2

Output

1.6799999999999999

Note

In the first sample, Kleofáš has overall score 6. Nobody else can have overall score less than 6 (but it's possible for one other person to have overall score 6 as well), so his overall rank must be 1.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/18/2024 13:18:44 (l2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|