#include //#include using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair const double EPS = 1e-12, PI = 3.1415926535897932384626; template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); double r, k; cin >> r >> k; rep(i, k) { double s = PI * ((double)i + 1.) / ((double)k + 1.); double ok = -r; double ng = r; //while(abs(ng-ok)>0.0001) { rep(i, 100) {//tleするなら調整する double mid = (ok + ng) / 2; auto check = [&]() { double sheeta = acos(mid / r); double x = PI - sheeta + cos(sheeta) *sin(sheeta); return x <= s; }; if (check()) ok = mid; else ng = mid; } printf("%.10f\n", ok); } return 0; }