#include <bits/stdc++.h>
using namespace std;
int gi() {
	int res = 0, w = 1;
	char ch = getchar();
	while (ch != '-' && !isdigit(ch)) ch = getchar();
	if (ch == '-') w = -1, ch = getchar();
	while (isdigit(ch)) res = res * 10 + ch - '0', ch = getchar();
	return res * w;
}
#define fi first
#define se second
#define pii pair<int, int>
using LL = long long;
using db = long double;
const int Mod = 998244353;
const int MAX_N = 105;
int N, M, a[MAX_N];
char str[MAX_N];
db C[MAX_N][MAX_N], suf[MAX_N][MAX_N];
db f(int s, int i) { return C[s][i]; }
void solve() {
	N = gi(), M = gi();
	for (int i = 1; i <= M; i++) a[i] = gi();
	C[N][0] = 1.0;
    for (int i = N - 1; i >= 1; i--)
        for (int j = 1; j <= N; j++)
            for (int k = i + 1; k <= N; k++)
                C[i][j] += C[k][j - 1] / (N - i);
	for (int i = 1; i < N; i++)
		for (int j = N - i; j >= 1; j--)
			suf[i][j] = suf[i][j + 1] + f(i, j);
	for (int i = 1; i <= M; i++) {
		db ans = 0;
		for (int j = 1; j <= N - a[i]; j++) {
			db tms = f(a[i], j);
			for (int k = 1; k <= M; k++)
				if (k != i) tms *= suf[a[k]][j];
			ans += tms;
		}
		printf("%0.10Lf ", ans);
	}
}
int main () {
#ifndef ONLINE_JUDGE
    freopen("cpp.in", "r", stdin);
	//freopen("cpp.out", "w", stdout);
#endif
	int T = 1; //T = gi();
	while (T--) {
		solve();
	}
    return 0;
}