#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;

ll read(){
	ll s=0,w=1; char ch=getchar();
	while (ch<'0'||ch>'9') {if (ch=='-') w=-1; ch=getchar();}
	while (ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^'0'), ch=getchar();
	return s*w;
}

void write(ll s){
	if (s<0) s=-s,putchar('-');
	if (s>9) write(s/10);
	putchar(s%10+'0');
}

void writeln(ll s){
	write(s); puts("");
}

void writeln(){
	puts("");
}

double f[105][105],s[105][105];

int n,m;
int a[107];

signed main(){
    scanf("%d%d",&n,&m);
    for (int i=1;i<=m;i++) scanf("%d",&a[i]);
    f[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++){
                f[i][j] += f[k][j-1]/(n-i);
            }
        }
    }
    for (int i=n-1;i>=1;i--){
        s[i][0] = 1.0;
        for (int j=1;j<=n;j++){
            s[i][j] = s[i][j-1] - f[i][j];
        }
    }
    for (int i=1;i<=m;i++){
        double ans = 0.0;
        for (int j=1;j<=n;j++){
            double p = f[a[i]][j];
            for (int k=1;k<=m;k++){
                if (i==k) continue;
                p *= s[a[k]][j-1];
            }
            //printf("%.9lf ",p);
            ans += p;
        }
        printf("%.9lf ",ans);
    }
    puts("");
    /*
    for (int i=1;i<=n;i++){
        for (int j=0;j<=n;j++){
            printf("%.2lf ",f[i][j]);
        }
        puts("");
    }
    puts("");
    for (int i=1;i<=n;i++){
        for (int j=0;j<=n;j++){
            printf("%.2lf ",s[i][j]);
        }
        puts("");
    }
    */
    return 0;
}