#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

int main(){
  ll r,k;cin >> r >> k;
  using ld=long double;
  vector<ld> ans;
  for(ll x=1;x<=k/2;x++){
    ld ok=0,ng=1;
    rep(_,50){
      ld mid=(ok+ng)/2;
      ld theta=acos(mid);
      ld sq=theta;
      sq-=sin(theta)*cos(theta);
      if(sq>=acos(-1)*x/(k+1))ok=mid;
      else ng=mid;
    }
    //cout << ok << endl;
    ans.emplace_back(ok);
  }
  ll f=ans.size();
  rep(i,f)ans.emplace_back(-ans[i]);
  if(k&1)ans.emplace_back(0);
  sort(all(ans));
  CST(10);
  for(auto p:ans)cout << p*r << endl;

}