#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define dbg(x) cerr << #x << ':' << (x) << endl;
#define ALL(x) x.begin(),x.end()

void solve() {
    int n,m;
    cin >> n >> m;
    vector<int> a(m);
    for (int i = 0; i < m; ++i) cin >> a[i];

    vector<vector<ld>> prob(n + 1, vector<ld> (n + 1));
    prob[n][0] = 1;
    for (int i = 1; i <= n; ++i)
    {
        ld sum = 0;
        for (int j = n - 1; j >= 0; --j)
        {
            sum += prob[j + 1][i - 1];
            prob[j][i] = sum / (n - j);
        }
    }
    // for (int i = 1; i <= n; ++i)
    // {
    //     for (int j = 0; j <= n; ++j) cout << prob[i][j] << " \n"[j == n];
    // }
    vector<vector<ld>> s(n + 1);
    for (int i = 1; i <= n; ++i) {
        s[i].push_back(0);
        partial_sum(ALL(prob[i]), back_inserter(s[i]));
    }

    for (int i = 0; i < m; ++i) {
        ld ans = 0;
        for (int j = 1; j <= n - a[i]; ++j) {
            ld x = 1;
            for (int k = 0; k < m; ++k) if (k != i) {
                x *= s[a[k]].back() - s[a[k]][j];
            }
            ans += prob[a[i]][j] * x;
        }
        cout << fixed << setprecision(20) << ans << " \n"[i==m-1];
    }
} 

int main()
{
    int t;
    // cin >> t;
    t = 1;
    while (t--) solve();
}