#include #include #include using namespace std; using namespace atcoder; using mint = modint998244353; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf32 1000000001 #define Inf64 4000000000000000001 long long R,K; double get(double h){ double r = R; return r * r * acos(1.0 - h/r) - (r-h) * sqrt(2.0 * r * h - h*h); } int main(){ double pi = acos(-1.0); cin>>R>>K; double S = R; S *= R; S *= pi; S /= K+1; vector ans; double last = 0.0; rep(i,1000000){ double ok = last,ng = 2.0*R; rep(_,50){ double mid = (ok+ng)/2.0; if(get(mid)-get(last)<=S)ok = mid; else ng = mid; } if(ok >= R-1e-10)break; ans.push_back(-R + ok); last = ok; } int t = ans.size(); rep(i,t)ans.push_back(-ans[i]); if(ans.size()!=K)ans.push_back(0.0); sort(ans.begin(),ans.end()); rep(i,K){ cout<