#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull;
typedef pair<int,int> pii;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=11;
int n,m;
double p[N];
const double Tmax=1e6;
const double eps=1e-7,dt=0.9998,ed=1e-7;
double fac[N];
double a[N],f[N];
inline double calc(double *p){
	rep(i,1,m){
		rep(i,0,n)f[i]=(!i)*fac[n];
		rep(j,1,m)if(j!=i){
			per(s,n-1,0){
				double res=p[j];
				for(int k=1;k<=s;++k,res*=p[j]){
					if(k==1&&j<i)continue;
					f[s]+=res*f[s-k]/fac[k];
				}
			}
		}
		a[i]=f[n-1];
	}
	double avr=0;rep(i,1,m)avr+=a[i];avr/=m;
	double s=0;rep(i,1,m)s+=(avr-a[i])*(avr-a[i]);
	return s;
}
mt19937 gen(114514);
int main() {
    //freopen("data.in", "r", stdin);
	n=read(),m=read();
	fac[0]=1;rep(i,1,n)fac[i]=fac[i-1]*i;
	if(m==1){ printf("1"); return 0; }
	rep(i,1,m)p[i]=1.0/m;
	double res=calc(p),T=Tmax;
	while(T>ed){
		//int x=1,y=1;
		//rep(i,2,m){
			//if(a[i]<a[x])x=i;
			//if(a[i]>a[y])y=i;
		//}
		int x=gen()%m+1,y=gen()%m+1;
		while(x==y)x=gen()%m+1,y=gen()%m+1;
		static double q[N];
		rep(i,1,m)q[i]=p[i];
		double t=min(q[x],q[x]*(T/Tmax));
		q[x]-=t,q[y]+=t;
		double now=calc(q);
		if(now<res){
			res=now;
			rep(i,1,m)p[i]=q[i];
		}
		T*=dt;
	}
	rep(i,1,m)printf("%.6lf\n",p[i]);
    return 0;
}