#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<ll>>;
using vi = vector<int>;
using vl = vector<long>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvll = vector<vll>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<long long, long long>;
using vpll = vector<pll>;
using mint = modint1000000007;
const long double EPS = 1e-18;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
#define reps(i, a, n) for (ll i = (a); i < (ll)(n); i++)
#define rep(i, n) for (ll i = (0); i < (ll)(n); i++)
#define rrep(i, n) for (ll i = (1); i < (ll)(n + 1); i++)
#define repd(i, n) for (ll i = n - 1; i >= 0; i--)
#define rrepd(i, n) for (ll i = n; i >= 1; i--)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b) (a <= x && x < b)
#define INIT                          \
    std::ios::sync_with_stdio(false); \
    std::cin.tie(0);
template <class T>
inline T CHMAX(T& a, const T b) {
    return a = (a < b) ? b : a;
}
template <class T>
inline T CHMIN(T& a, const T b) {
    return a = (a > b) ? b : a;
}
ld f(ld x) { return 1.0 * (2.0 * x - sinl(2.0 * x)); }
int main() {
    ll R, K;
    cin >> R >> K;
    vector<ld> ans;
    ld cut = 1.0 / (K + 1);
    ld kakuhen = PI / 2.0;
    kakuhen /= 80000000;
    ll cnt = 0;
    rrep(i, K / 2) {
        ld menseki = 2.0 * PI * cut * i;
        while (f(cnt * kakuhen) < menseki) {
            cnt++;
        }
        ld kaku = 1.0 * cnt * kakuhen;
        ans.push_back(1.0 * R * cosl(kaku));
    }
    ll n = ans.size();
    rep(i, n) { ans.push_back(-1.0 * ans[i]); }
    if (K % 2) {
        ans.push_back((ld)0.0);
    }
    sort(ALL(ans));
    for (auto x : ans) {
        cout << setprecision(12) << x << endl;
    }
    return 0;
}