#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<ld, ld> point;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int N = (int)(20) + 7;
const int M = (int)(1e3) + 7;
const ll MOD = (ll)(998244353);
const ll INF = (ll)(1e10) + 7;
const ld eps = (ld)(1e-12);
 
#define pb push_back
#define mp make_pair
#define x first
#define y second

void precalc() {
}

void solve(int num_t) {
    ld r, k;
    cin >> r >> k;
    for (int i = 0; i < k; ++i) {
        ld ll = -r, rr = r;
        for (int j = 0; j < 100; ++j) {
            ld x = (ll + rr) / 2.0;
            ld y = sqrt(r * r - x * x);
            ld ans = x * y + r * r * atan2(x, y) + (M_PI * r * r) / (ld)(2.0);
            if (ans > (M_PI * r * r * (i + 1)) / (ld)(k + 1)) {
                rr = x;
            } else {
                ll = x;
            }
        }
        printf("%1.12lf\n", (double)(ll));
    }
}

int main() {
    precalc();
	/*int ttt;
	cin >> ttt;
	for (int i = 0; i < ttt; ++i) {
	    solve(i);
	}//*/solve(0);
	return 0;
}