#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;

#include <cmath>

int main(){
    double R; cin >> R;
    int K; cin >> K; K++;
    double PI = acos(-1.0);
    auto f = [](double x){
        return x * sqrt(1.0 - x * x) + acos(-x);
    };
    cout.precision(10);
    fixed(cout);
    for(int i=1; i<K; i++){
        double x = PI * i / K;
        double l = -1.0, r = 1.0;
        while(r - l >= 1.0e-6){
            double m = (l + r) / 2;
            if(f(m) < x) l = m; else r = m;
        }
        cout << (l*R) << '\n';
    }
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;