#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;


int main() {
  ios::sync_with_stdio(false);
  double r;
  int k;
  cin >> r >> k;
  vector<double> y;
  default_random_engine e; 
  uniform_real_distribution<double> p(-r, r);
  for (int i = 0; i < 5e6; ++i) {
    double yi = p(e);
    if (hypot(p(e), yi) < r)
      y.push_back(yi);
  }
  while (y.size() % (k + 1))
    y.pop_back();
  sort(y.begin(), y.end());
  int c = y.size() / (k + 1);
  for (int i = 1; i <= k; ++i)
    cout << y[c * i] << endl;
  
  return 0;
}