Problem: There 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 ai 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 a1, a2, ... , am (1 ≤ ai ≤ 50). ai 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
const long double EPS = 1e-9;
int n, m;
int a[N];
long long fact[N];
long long C[N][N];
long double dp[N][N][N];
int main() {
  for (int i = 0; i <= 50; ++i) C[0][i] = 1;
  for (int i = 1; i <= 50; ++i) {
    for (int j = i; j <= 50; ++j) C[i][j] = C[i][j - 1] + C[i - 1][j - 1];
  }
  cin >> m >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  dp[0][0][0] = 1.00;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j <= m; ++j)
      for (int k = 0; k <= 50; ++k)
        for (int x = 0; x <= m - j; ++x) {
          int val = (x + a[i + 1] - 1) / a[i + 1];
          long double frac = (long double)C[x][m - j] /
                             pow((long double)n - i, (long double)x);
          frac *=
              pow((long double)(n - i - 1) / (n - i), (long double)m - j - x);
          dp[i + 1][j + x][max(val, k)] += dp[i][j][k] * frac;
        }
  long double ans = 0;
  for (int val = 0; val <= 50; ++val) {
    ans += dp[n][m][val] * val;
  }
  cout << fixed << setprecision(15) << ans << endl;
  return 0;
}