#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    double R,K;cin>>R>>K;
    vector<double> ans;
    for(int q=0;q<(int)(K)/2;q++){
        double le=0,ri=R;
        for(int qq=0;qq<80;qq++){
            double mid=(le+ri)/2;
            double X=sqrt(R*R-mid*mid);
            double res=R*R*atan2(X,mid);
            //cout<<X<<" "<<mid<<" "<<atan2(X,mid)<<endl;
            res-=X*mid;
            //cout<<res<<" "<<R*R*M_PI<<" "<<R*R*M_PI*(q+1)/(K+1)<<endl;
            if(res>=R*R*M_PI*(q+1)/(K+1)) le=mid;
            else ri=mid;
        }
        ans.push_back(le);
    }
    
    if((int)(K)&1) ans.push_back(0);
    
    for(int i=0;i<(int)(K)/2;i++) ans.push_back(-ans[i]);
    
    sort(all(ans));
    
    for(double x:ans) cout<<fixed<<setprecision(25)<<x<<endl;
}