#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

using Pair = pair<int, int>;
using Tuple = tuple<int, int, int>;
using VI1 = vector<int>;
using VI2 = vector<VI1>;
using VL1 = vector<ll>;
using VL2 = vector<VL1>;
using VD1 = vector<ld>;
using VD2 = vector<VD1>;
using VB1 = vector<bool>;
using VB2 = vector<VB1>;
using VP1 = vector<Pair>;
using VP2 = vector<VP1>;
using VT1 = vector<Tuple>;
using VT2 = vector<VT1>;

using Queue = queue<int>;
using DQ = deque<int>;
using PQ = priority_queue<int, vector<int>, greater<int>>;
using Table = VI2;
using Graph = VI2;

/** io */
template <typename T>
std::vector<T> input_vec(int N);
template <typename T>
void output_row(std::vector<T> &row);
template <typename T>
void output_col(std::vector<T> &col);
void outputYesNo(bool yes, const string &Yes = "Yes", const string &No = "No");
/** minmax */
template <typename T>
bool chmin(T &a, T b);
template <typename T>
bool chmax(T &a, T b);

ld func(ld x) {
  auto phi = acosl(x);
  return (phi - x * sqrtl(abs(1 - x * x))) / 2;
}

VD1 solve() {
  // 90 度回転させて考える。
  int R, K;
  cin >> R >> K;
  if (K == 1) {
    return {0};
  }
  ld area = ld(M_PI) / (2 * (K + 1));
  int K2 = K / 2;
  VD1 csum(K2 + 1, 0);
  VD1 x(K2 + 1, 1);
  for (int i = 0; i < K2; ++i) {
    ld ok = 0;
    ld ng = x.at(i);
    for (int j = 0; j < 30; ++j) {
      auto mid = (ok + ng) / 2;
      if (csum.at(i) + area < func(mid))
        ok = mid;
      else
        ng = mid;
    }
    x.at(i + 1) = ok;
    csum.at(i + 1) = csum.at(0) + func(ok);
  }
  VD1 result(K, 0);
  for (int i = 0; i < K2; ++i) {
    auto x1 = x.at(i + 1) * R;
    result.at(i) = -x1;
    result.at(K - 1 - i) = x1;
  }
  return result;
}

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int t = 1;
  // cin >> t;
  while (t--) {
    auto result = solve();
    // cout << result << '\n';
    // output_row(result);
    cout << setprecision(10);
    output_col(result);
    // outputYesNo(result, "Yes", "No");
  }
}

/** @note 使用頻度が高く毎回貼付するのが面倒なライブラリを実装しておく。*/

template <typename T>
std::vector<T> input_vec(int N) {
  std::vector<T> v(N);
  for (auto &vi : v) {
    cin >> vi;
  }
  return v;
}

void outputYesNo(bool yes, const string &Yes, const string &No) {
  if (yes)
    cout << Yes << '\n';
  else
    cout << No << '\n';
}

template <typename T>
void output_row(std::vector<T> &row) {
  int N = row.size();
  for (int i = 0; i < N; ++i) {
    if (i > 0) cout << ' ';
    cout << row.at(i);
  }
  cout << '\n';
}

template <typename T>
void output_col(std::vector<T> &col) {
  int N = col.size();
  for (int i = 0; i < N; ++i) {
    cout << col.at(i) << '\n';
  }
}

template <typename T>
bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T>
bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}