#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ull;
typedef pair<int, int> PII;
#define mem(trie, a) memset((trie), (a), sizeof(trie))
const int N = 1e2 + 10;
double a[N], b[N];
int n;
double aa, bb;
int check(double x)
{
    b[1] = a[1];
    b[2] = x;
    for (int i = 3; i <= n; i++)
    {
        b[i] = b[i - 2] * aa + b[i - 1] * bb;
    }
    return b[n] > a[n];
}
void solve()
{

    cin >> aa >> bb >> n;
    cin >> a[1] >> a[n];
    double l = -1e9, r = 1e9;
    while (fabs(r - l) > 1e-10)
    {
        double mid = (l + r) / 2;
        if (check(mid))
            r = mid;
        else
            l = mid;
    }
    b[1] = a[1];
    b[2] = l;
    for (int i = 3; i <= n; i++)
    {
        b[i] = b[i - 2] * aa + b[i - 1] * bb;
    }
    for (int i = 1; i <= n; i++)
    {
        cout <<fixed<<setprecision(9)<< b[i] << endl;
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}