#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
#include<cassert>
#include<cmath>
#include<iomanip>
#include<map>
#include<functional>
//#include<bits/stdc++.h>
using namespace std;
using ll = long long;


double calc(double r,double l){
    double x = sqrt(r*r-l*l);
    double y = l;
    double theta = atan2(y,x);
    theta = acos(-1)/2 - theta;
   
    double now =  r* r;
    now *=theta;

    now -= x * l;

    return now;

}

int main(){
    ll r,k;
    cin>>r>>k;
    vector<double> ans;
    double all = acos(-1) * r * r;
    double want = all / (double)(k+1);
    double use = 0;
    double last = r;
    //cout<<calc(r,0)<<" "<<want<<endl;
    //cout<<calc(r,0.264)<<endl;
    for(int i = 0;i<k;i++){
        double right = last;
        double left = -r;
        int q = 100;
        while(q--){
            double mid = (right+left)/2.;
            double now = 0;
            now += calc(r,abs(mid));
            if(mid>=0) now = now - use;
            else now = all - use - now;
            if(now>want) left = mid;
            else right = mid;
        }
       // cout<<right<<endl;
        ans.push_back(right);
        last = right;
        use += want;
    }
    cout<<fixed<<setprecision(30);
    sort(ans.begin(),ans.end());
    for(int i = 0;i<ans.size();i++) cout<<ans[i]<<endl;
}