#pragma region Macros
#include <bits/stdc++.h>
#include <atcoder/all>
#if defined(LOCAL) || defined(_DEBUG)
#include "debug.hpp"
#else
#define O(...)
#define START()
#define STOP()
#define MEMORY()
#endif
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i=(n); i>=0; --i)
#define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##_len; ++i)
#define EACH(i, v) for(const auto& i : v)
#define ALL(x) (x).begin(),(x).end()
#define ALLR(x) (x).rbegin(),(x).rend()
template<class T, class U>bool chmax(T &a, const U &b) { if (a<(T)b) { a=(T)b; return 1; } return 0; }
template<class T, class U>bool chmin(T &a, const U &b) { if (b<(T)a) { a=(T)b; return 1; } return 0; }
#define vec vector
#define umap unordered_map
#define uset unordered_set
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Tup = tuple<ll, ll, ll>;
using vl = vec<ll>;
#define fi first
#define se second
#define el endl
constexpr ll INF = numeric_limits<ll>::max()/2-1;

template<class T> istream &operator>>(istream &stream, vec<T>& o){REP(i, o.size())stream >> o[i];return stream;}
template<class T, class U> istream &operator>>(istream &stream, pair<T, U>& o){cin >> o.fi >> o.se; return stream;}
namespace myinput {
    void input() {}
    template<class T, class... Ts> void input(T&& o, Ts&&... args){cin >> o;input(forward<Ts>(args)...);}
    void assign_vl(size_t siz) {};
    template<class T, class... Ts> void assign_vl(size_t siz, T&& o, Ts&&... args){o.resize(siz);assign_vl(siz, forward<Ts>(args)...);}
    void input_horizon_sub(size_t index) {};
    template<class T, class... Ts> void input_horizon_sub(size_t index, T&& o, Ts&&... args) {cin>>o[index];input_horizon_sub(index, forward<Ts>(args)...);}
    template<class... Ts> void input_horizon(size_t siz, Ts&&... args){REP(i, siz) input_horizon_sub(i, forward<Ts>(args)...);}
}
#define _I(T, ...) ;myinput::input(__VA_ARGS__);
#define I(T, ...) ;T __VA_ARGS__;_I(T, __VA_ARGS__);
#define _Iv(T, siz, ...) ;myinput::assign_vl(siz, __VA_ARGS__);myinput::input(__VA_ARGS__);
#define Iv(T, siz, ...) ;vec<T> __VA_ARGS__;_Iv(T, siz, __VA_ARGS__);
#define _Ih(T, siz, ...) ;myinput::assign_vl(siz, __VA_ARGS__);myinput::input_horizon(siz, __VA_ARGS__);
#define Ih(T, siz, ...) ;vec<T> __VA_ARGS__;_Ih(T, siz, __VA_ARGS__);
#pragma endregion

void Main();

int main(){
    std::cin.tie(nullptr);
    std::cout << std::fixed << std::setprecision(15);
    Main();
    MEMORY();
    return 0;
}

// x∈[l, r] | f(x) = true となる最大のxを返す
template <class Func>
ll binarySearch(ll l, ll r, const Func &f){
    r++;
    while(l < r + 1){
        const ll m = (l<0)==(r<0) ? l+(r-l)/2 : (l<-r) ? -((-l-r-1)/2+1) : (l+r)/2;
        if(f(m)) l = m+1;
        else     r = m-1;
    }
    return r;
}

template <typename T, typename U>
U __typechange(T n) {
    if(n >= 0) return *(U*)(&n);
    n = -n;
    return -*(U*)(&n);
}
template <class Func>
double binarySearchd(double l, double r, const Func &f) {
    return __typechange<ll, double>(
        binarySearch(__typechange<double, ll>(l), __typechange<double, ll>(r), 
            [&](ll mi) { return f(__typechange<ll, double>(mi)); }
        )
    );
}

void Main(){
    /*
    REP(i, 20) {
        ll r = 1;
        double h = r-(i/10.0-1.0)/100.0;
        double theta = 2*acos(1-h/r);
        double s = theta*r*r/2 - (r-h) * sqrt(h*(2*r-h));
        O(s);
    }*/
    I(ll, r, k);
    double piece = M_PI*r*r / (k+1);
    O(piece);
    REP(i, k) {
        double ret = binarySearchd(-r, r, [&](double d) {
            double h = r-d;
            double theta = 2*acos(1-h/r);
            double s = theta*r*r/2 - (r-h) * sqrt(h*(2*r-h));
            return s > piece*(k-i);
        });
        cout << ret << el;
    }
}