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

using namespace std;
using ll = long long;

int main(){

    long double R, pi=M_PI, S, T, U;
    int K;
    cin >> R >> K;
    S = pi*R*R / (long double) (K+1);
    vector<long double> v;

    long double l, r, c;

    if (K % 2 == 0){
        K -= 2;
        T = 0;
        l=0, r=pi/2;
        for (int j=0; j<100; j++){
            c = (l+r)/2;
            U = (c + sin(c)*cos(c)) * R * R;
            if (U*2 <= S) l=c;
            else r=c;
        }
        T = (l + sin(l)*cos(l)) * R * R;
        v.push_back(R*sin(l)); v.push_back(-R*sin(l));
        for (int i=0; i<K/2; i++){
            l=0, r=pi/2;
            for (int j=0; j<100; j++){
                c = (l+r)/2;
                U = (c + sin(c)*cos(c)) * R * R - T;
                if (U <= S) l=c;
                else r=c;
            }
            T = (l + sin(l)*cos(l)) * R * R;
            v.push_back(R*sin(l)); v.push_back(-R*sin(l));
        }
    }
    else{
        v.push_back(0);
        T = 0;
        for (int i=0; i<K/2; i++){
            l=0, r=pi/2;
            for (int j=0; j<100; j++){
                c = (l+r)/2;
                U = (c + sin(c)*cos(c)) * R * R - T;
                if (U <= S) l=c;
                else r=c;
            }
            T = (l + sin(l)*cos(l)) * R * R;
            v.push_back(R*sin(l)); v.push_back(-R*sin(l));
        }
    }
    
    sort(v.begin(), v.end());
    for (auto x : v) cout << setprecision(18) << x << endl;

    return 0;
}