#include <bits/stdc++.h>
using namespace std;

const double eps = 1e-7;
void solve()
{
    double a, b;
    int n;
    vector<double> x(n + 1);
    cin >> a >> b >> n >> x[1] >> x[n];
    if (n == 2)
    {

        cout << fixed << setprecision(10);
        cout << x[1] << '\n';
        cout << x[n] << '\n';
        return;
    }
    auto check = [&](double y)
    {
        x[2] = y;

        for (int i = 3; i < n; i++)
        {
            x[i] = x[i - 1] * a + x[i - 2] * b;
        }
        double res = x[n - 1] * a + x[n - 2] * b;
        return res >= x[n];
    };
    double l = -1e9,
           r = 1e9;
    cout << fixed << setprecision(10);
    while (l <= r)
    {
        if (r - l < eps)
        {
            break;
        }
        double mid = (l + r) / 2.0;
        if (check(mid))
        {
            r = mid;
        }
        else
            l = mid;
    }
    x[2] = l;

    for (int i = 3; i < n; i++)
    {
        x[i] = x[i - 1] * a + x[i - 2] * b;
    }
    for (int i = 1; i <= n; i++)
    {
        cout << x[i] << '\n';
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}