#line 2 "/home/sakflat/CP/_library/cpp/template/template.cpp"

//yukicoder@cpp17

#include <iostream>
#include <iomanip>

#include <algorithm>

#include <cmath>
#include <cctype>
#include <climits>
#include <cassert>

#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>

#include <random>

#include <bitset>

#include <complex>

#include <utility>

#include <numeric>

#include <functional>


using namespace std;
using ll = long long;
using P = pair<ll,ll>;

const ll MOD = 998244353;
const ll MODx = 1000000007;
const int INF = (1<<30)-1;
const ll LINF = (1LL<<62LL)-1;
const double EPS = (1e-10);

P ar4[4] = {{0,1},{0,-1},{1,0},{-1,0}};
P ar8[8] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};




template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }
 
/*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる

計算量は変わらないが楽できるシリーズ
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/

/* comment outed because can cause bugs
__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}
*/
#line 2 "/home/sakflat/CP/_library/cpp/template/basic.cpp"

int main(){
  long long r,k;cin>>r>>k;
  long double area = (long double)r*r*acos(-1)/(k+1);
  vector<long double> ans(k);
  for(int i = 1; k/2 >= i; i++){
    long double mn = 0;
    long double mx = r;
    while(mx-mn > 1e-6){
      long double ce = (mx+mn)/2;
      long double ohg = (acos((4*ce*ce-2*r*r)/(2*r*r))/(2*acos(-1))) * (r*r*acos(-1));
      //cout << acos((4*ce*ce-2*r*r)/(2*r*r)) << " "  << ohg << " " << (ce* sqrt(r*r-ce*ce))<< endl;
      if(ohg - (ce * sqrt(r*r-ce*ce)) < i*area){
        mx = ce;
      }else{
        mn = ce;
      }
    }
    ans[i-1] = mn;
  }
  if(k%2)ans[k/2] = 0;
  for(int i = k; k/2 < i; i--){
    ans[i-1] = ans[k-i];
    ans[k-i]*=-1;
  }
  for(int i = 0; k > i; i++){
    cout << fixed << setprecision(10) << ans[i] << endl;
  }
  return 0;
}