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

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll R,K;
double PI;

double hoge(double Y) {
	if(Y==0) {
		return R*R*PI/2;
	}
	if(Y>=0) {
		return R*R*PI-hoge(-Y);
	}
	double deg=atan2(sqrt(R*R-Y*Y),-Y);
	double ret=R*R*deg-(-Y)*sqrt(R*R-Y*Y);
	return ret;
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	PI=atan(1)*4;
	
	cin>>R>>K;
	double a=R*R*PI;
	for(i=1;i<=K;i++) {
		double ta=i*a/(K+1);
		double A=-R,B=R;
		FOR(j,100) {
			double M=(A+B)/2;
			if(hoge(M)>=ta) {
				B=M;
			}
			else {
				A=M;
			}
		}
		_P("%.12lf\n",A);
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}