#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

const double PI = acos(-1.0L);

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    int R, K;
    cin >> R >> K;
    vector<double> ans;
    for (int i = 1; 2 * i <= K; i++) {
        double lb = 0, ub = PI / 2;
        for (int _ = 0; _ < 100; _++) {
            double mid = (ub + lb) / 2;
            double area = mid;
            area -= cos(mid) * sin(mid);
            (area < PI / (K + 1) * i ? lb : ub) = mid;
        }
        ans.emplace_back(-R * cos(lb));
    }

    for (auto& x : ans) cout << x << '\n';
    if (K & 1) cout << 0 << '\n';
    reverse(all(ans));
    for (auto& x : ans) cout << -x << '\n';
    return 0;
}