#include <algorithm>
#include <bit>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <random>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <set>
#include <string>

using namespace::std;

double f(double m) {
  return m * sqrt(1 - m * m) + asin(m);
}

int main() {
  ios::sync_with_stdio(false);
  double r;
  int k;
  cin >> r >> k;
  double a = -1; 
  for (int i = 1; i <= k; ++i) {
    double b = 1;
    for (int j = 0; j < 100; ++j) {
      double m = (a + b) / 2;
      if (abs(f(m) - f(-1)) < ((double) M_PI) * i / (k + 1) ) a = m;
      else b = m;
    }
    cout << r * a << endl;
  }
  
  return 0;
}