// #pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using ld = long double;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
#define mem(a, b) memset((a), (b), sizeof(a))
#define all(a) (a).begin(), (a).end()
#define inf 0x3f3f3f3f
#define lowbit(x) (-x) & x
#define ls u << 1
#define rs u << 1 | 1
#define int long long
mt19937 rnd(time(0));
const int MOD = 1e9+7;
int qmi(int m, int k){int res = 1, t = m;while (k){if (k & 1) res = (res * t) % MOD;t = t * t % MOD;k >>= 1;}return res;}
const int N = 1e6 + 7;
const ld eps = 1;
vector<array<int,6>> cor;
void solve()
{
    int n;
    ld a,b,x1,xn;
    cin>>a>>b>>n;
    vector<ld> x(n+1);
    cin>>x[1]>>x[n];
    map<array<int,2>,int> ma[n+1][3];
    ma[1][1][{0,0}] = 1;
    ma[2][2][{0,0}] = 1;
    // ma[3][1][{0,1}] = 1;
    // ma[3][2][{1,0}] = 1;
    for(int i=3;i<=n;i++)
    {
        for(int j=1;j<=2;j++)
        {
            for(auto [c,d]:ma[i-2][j])
            {
                auto [a,b] = c;
                ma[i][j][{a,b+1}]+=d;
            }
            for(auto [c,d]:ma[i-1][j])
            {
                auto [a,b] = c;
                ma[i][j][{a+1,b}]+=d;
            }
        }
        // cout<<i<<"\n";
        // for(auto [c,d]:ma[i][1])
        //     cout<<d<<"* "<<"<"<<c[0]<<" "<<c[1]<<">, ";
        // cout<<"\n";
        // for(auto [c,d]:ma[i][2])
        //     cout<<d<<"* "<<"<"<<c[0]<<" "<<c[1]<<">, ";
        // cout<<"\n";
    }
    ld k1 = 0, k2 = 0;
    for(auto [c,d]:ma[n][1])
    {
        auto [a0,b0] = c;
        ld res = d;
        for(int i=1;i<=a0;i++)
            res *= a;
        for(int i=1;i<=b0;i++)
            res *= b;
        k1 += res;
    }
    for(auto [c,d]:ma[n][2])
    {
        auto [a0,b0] = c;
        ld res = d;
        for(int i=1;i<=a0;i++)
            res *= a;
        for(int i=1;i<=b0;i++)
            res *= b;
        k2 += res;
    }
    x[2] = (x[n] - k1 * x[1]) / k2;
    for(int i=3;i<=n;i++)
        x[i] = x[i-1]*a + x[i-2] *b;
    // for(int i=3;i<=n;i++)
    //     x[i] = x[i-2]*a + x[i-1] *b;
    for(int i=1;i<=n;i++)
        cout<<fixed<<setprecision(18)<<x[i]<<"\n";

}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
        solve();
    return 0;
}
/*
-7.37131875
0.25^4+3*0.25^2*
*/