Survey

아직 제출이 없습니다시간 제한1초메모리 제한512 MB

문제

You are doing a survey and want to find respondents in your social group. Your social group has size nn, and you have a budget of mm dollars. You need to divide the mm dollars into n n shares. Each group member will get one of the shares uniformly at random. Note that the money contained in each share can be any non-negative real number.

Luckily, you know the reward threshold of each group member. If a person has a reward threshold of xx, they will participate in the survey if and only if they have received a share of at least xx dollars, otherwise they will just accept the payment and not participate in the survey. Since you want as many group members as possible to participate in the survey, you need to design a plan to divide the mm dollars into nn shares in order to maximize the expected number of members who will participate in the survey.

입력

The first line contains two integers nn (1n10001\leq n\leq 1000) and mm (1m50001\leq m\leq 5000), denoting the number of group members and your budget.

The next line contains nn integers x_1,x_2,,x_nx\_1, x\_2, \ldots, x\_n (0x_im0 \le x\_i \le m), denoting the reward threshold of each member.

출력

Print a single real number: the maximum expected number of members to participate in the survey.

The answer will be considered correct if the absolute or relative error between the output and the jury's answer is at most 10910^{-9}.