시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2 초 512 MB 2 2 2 100.000%

## 문제

Assuming that n − 1 other people with skill levels a1, a2, . . . , an−1 are standing in a queue prepared for a Rock Paper Scissors tournament and your own skill level is x, find the probability that you will win the tournament after inserting yourself into any of the n positions in the queue (before person 1, between people 1 and 2, . . ., after person n − 1):

• while the queue has at least two people, two people are popped from the front of the queue and play a match (if people with skill levels p and q play a match, the first one wins with probability p/(p+q) and the second one wins with probability q/(p+q), there are no draws);
• the winner of the match gets pushed to the back of the queue, while the loser is eliminated;
• the last person standing in the queue is declared the winner of the tournament.

## 입력

The first line contains two integers n and x (2 ≤ n ≤ 4096; n = 2k for an integer k; 1 ≤ x ≤ 104).

The second line contains n − 1 integers a1, a2, . . . , an−1 (1 ≤ ai ≤ 104). a1 is the skill level of the person at the front of the queue, while an−1 corresponds to the person at the back.

## 출력

For each of the n positions in the queue where you can insert yourself, from the front to the back, display the probability of winning the tournament.

Your answer will be considered correct if its absolute or relative error doesn’t exceed 10−9.

## 예제 입력 1

4 2
1 1 1


## 예제 출력 1

0.444444444444444
0.444444444444444
0.444444444444444
0.444444444444444


## 예제 입력 2

4 3
4 5 2


## 예제 출력 2

0.188265306122449
0.188265306122449
0.239285714285714
0.239285714285714


## 예제 입력 3

8 8
1 2 3 4 5 6 7


## 예제 출력 3

0.393768719371413
0.393768719371413
0.353382184051268
0.353382184051268
0.248207450668989
0.248207450668989
0.230924146560510
0.230924146560510


## 힌트

In the first test case, you beat any opponent with probability 2/3. To win the tournament, you need to beat two opponents, hence the answer is 4/9 regardless of your initial position.