Problem: Igor the analyst has adopted n little bunnies. As we all know, bunnies love carrots. Thus, Igor has bought a carrot to be shared between his bunnies. Igor wants to treat all the bunnies equally, and thus he wants to cut the carrot into n pieces of equal area. 

Formally, the carrot can be viewed as an isosceles triangle with base length equal to 1 and height equal to h. Igor wants to make n - 1 cuts parallel to the base to cut the carrot into n pieces. He wants to make sure that all n pieces have the same area. Can you help Igor determine where to cut the carrot so that each piece have equal area?

<image> Illustration to the first example.

Input

The first and only line of input contains two space-separated integers, n and h (2 ≤ n ≤ 1000, 1 ≤ h ≤ 105).

Output

The output should contain n - 1 real numbers x1, x2, ..., xn - 1. The number xi denotes that the i-th cut must be made xi units away from the apex of the carrot. In addition, 0 < x1 < x2 < ... < xn - 1 < h must hold. 

Your output will be considered correct if absolute or relative error of every number in your output doesn't exceed 10 - 6.

Formally, let your answer be a, and the jury's answer be b. Your answer is considered correct if <image>.

Examples

Input

3 2


Output

1.154700538379 1.632993161855


Input

2 100000


Output

70710.678118654752

Note

Definition of isosceles triangle: <https://en.wikipedia.org/wiki/Isosceles_triangle>.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
char local = 'O';
template <typename T>
void read(T &p) {
  cin >> p;
}
template <typename T, typename T1>
void read(pair<T, T1> &p) {
  read(p.first);
  read(p.second);
}
template <typename T>
void read(T arr[], long long n) {
  for (long long i = 0; i < n; i++) {
    read(arr[i]);
  }
}
template <typename T>
void read(vector<T> &arr) {
  for (long long i = 0; i < arr.size(); i++) {
    read(arr[i]);
  }
}
template <typename T>
void out(T &n) {
  cout << n;
}
template <typename T, typename T1>
void out(pair<T, T1> &p) {
  cout << "(";
  out(p.first);
  cout << ",";
  out(p.second);
  cout << ")";
}
template <typename T>
void out(T arr[], long long n) {
  for (long long i = 0; i < n; i++) {
    out(arr[i]);
    cout << " ";
  }
}
template <typename T>
void out(vector<T> &arr) {
  for (long long i = 0; i < arr.size(); i++) {
    out(arr[i]);
    cout << " ";
  }
}
template <typename T>
void out(set<T> &arr) {
  for (auto i : arr) {
    out(i);
    cout << " ";
  }
}
template <typename T>
void out(multiset<T> &arr) {
  for (auto i : arr) {
    out(i);
    cout << " ";
  }
}
template <typename T, typename T1>
void out(map<T, T1> &m) {
  for (auto i : m) {
    out(i.first);
    cout << " -> ";
    out(i.second);
    cout << ", ";
  }
}
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cout << name << " : ";
  out(arg1);
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
  const char *comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : ";
  out(arg1);
  cout << " | ";
  __f(comma + 1, args...);
}
template <class T>
void debug(T n, string a) {
  cout << a << "=" << n << "\n";
}
void cal() {}
void solve() {
  int n, h;
  cin >> n >> h;
  for (int i = 1; i < n; i++) {
    cout << fixed << setprecision(15) << (sqrt(i / (n * 1.0)) * h) << ' ';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t1;
  t1 = 1;
  cal();
  while (t1--) {
    solve();
  }
}