#include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; int main() { int r, k; cin >> r >> k; const double area = numbers::pi / (k + 1); vector ans(k, 0); REP(i, k / 2) { const double a = area * (i + 1); double lb = (ans.empty() ? 0 : ans.back()), ub = numbers::pi / 2; REP(_, 80) { const double mid = midpoint(lb, ub); (mid - sin(mid * 2) / 2 > a ? ub : lb) = mid; } ans[i] = lb; } REP(i, k / 2) ans[i] = -cos(ans[i]) * r; FOR(i, k / 2, k / 2 * 2) ans[i] = -ans[i - k / 2]; ranges::sort(ans); REP(i, k) cout << ans[i] << '\n'; return 0; }