#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<ll,ll> P;
typedef pair<int,P> PP;
const ll MOD=998244353;
const double PI=acos(-1);

double area(double r,double y){
    double theta=acos(y/r);

    return r*r*theta - y*sqrt(r*r-y*y);

}

int main(){
    int R,K;
    cin>>R>>K;

    int halfK=K/2;

    vector<double> ans;
    
    double upperb=R;
    for(int k=1;k<=halfK;k++){
        double ub=upperb;
        double lb=0;
        
        double Sk=PI*R*R*k/(K+1);

        for(int x=0;x<100;x++){
            double mid=(ub+lb)/2;

            //cout<<"k="<<k<<endl;
            //cout<<"ub="<<ub<<endl;
            //cout<<"lb="<<lb<<endl;


            if(area(R,mid)<=Sk){
                ub=mid;
            }else{
                lb=mid;
            }

        }
        //cout<<"ub="<<ub<<endl;

        ans.push_back(ub);

        //upperb=ub;
    }

    sort(ans.begin(),ans.end());//絶対値が小さい順
    reverse(ans.begin(),ans.end());//絶対値が大きい
    int n=ans.size();

    if(K%2==1){

        for(int k=0;k<n;k++){
            printf("%.8f\n",-ans[k]);
        }
        
        printf("%.8f\n",0);

        for(int k=n-1;k>=0;k--){
            printf("%.8f\n",ans[k]);
        }

        
        
    }else{
        
        for(int k=0;k<n;k++){
            printf("%.8f\n",-ans[k]);
        }


        for(int k=n-1;k>=0;k--){
            printf("%.8f\n",ans[k]);
        }
        
    }


}