#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

double pi = acos(-1);

double f(double R, double th){
  double s = R * R * th / 2 - R*R*cos(th)*sin(th)/2;
  return s;
}

int main(){
  double R; ll K;
  cin >> R >> K;
  double S = R * R * pi / 2;
  for(ll k=1;k<=K;k++){
    double s = S * k / (K+1);
    double ok = pi, ng = 0;
    rep(i,200){
      double mid = (ok + ng)/2;
      if(f(R,mid) > s) ok = mid;
      else ng = mid;
    }
    cout << fixed << setprecision(20) << R*sin(ok-pi/2) << '\n';
  }
  return 0;
};