#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int r, k; cin >> r >> k; k++;
    double area = (double)r*(double)r*M_PI;
    int mx = (k-1)/2;
    vector<double> v;
    for(int x = 1; x <= mx; x++){
        auto f = [&](double h){
            double theta = acos(h/r);
            double s = theta*r*r - h*r*sin(theta);
            return s >= ((area/k)*x);
        };
        double rh = r, lh = 0;
        int iter = 50;
        while(iter--){
            double h = (lh+rh)/2;
            if(f(h)){
                lh = h;
            }else{
                rh = h;
            }
        }
        v.push_back(lh);
    }
    vector<double> ans = v;
    if(k%2 == 0) ans.push_back(0);
    reverse(v.begin(), v.end());
    for(double x: v) ans.push_back(-x);
    for(double x: ans) cout << -x << '\n';
}