The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

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.

combinatorics

dp

probabilities

*2200

No tag edit access

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

×
C. Bath Queue

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThere are *n* students living in the campus. Every morning all students wake up at the same time and go to wash. There are *m* rooms with wash basins. The *i*-th of these rooms contains *a*_{i} wash basins. Every student independently select one the rooms with equal probability and goes to it. After all students selected their rooms, students in each room divide into queues by the number of wash basins so that the size of the largest queue is the least possible. Calculate the expected value of the size of the largest queue among all rooms.

Input

The first line contains two positive integers *n* and *m* (1 ≤ *n*, *m* ≤ 50) — the amount of students and the amount of rooms. The second line contains *m* integers *a*_{1}, *a*_{2}, ... , *a*_{m} (1 ≤ *a*_{i} ≤ 50). *a*_{i} means the amount of wash basins in the *i*-th room.

Output

Output single number: the expected value of the size of the largest queue. Your answer must have an absolute or relative error less than 10^{ - 9}.

Examples

Input

1 1

2

Output

1.00000000000000000000

Input

2 2

1 1

Output

1.50000000000000000000

Input

2 3

1 1 1

Output

1.33333333333333350000

Input

7 5

1 1 2 3 1

Output

2.50216960000000070000

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/10/2023 21:25:14 (l1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|