#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define ll long long
#define endl '\n'
#define all(a) a.begin(), a.end()
#define pb push_back
#define x first
#define y second
#define debug(_x) cout << #_x << '=' << _x << endl
typedef pair<int, int> PII;
using i64 = long long;
const int mod = 1e9 + 7;
const int N = 100 + 10;

void solve()
{
    double a, b, X1, Xn;
    int n;
    cin >> a >> b >> n >> X1 >> Xn;
    vector<double> f(n);
    f[0] = 1;
    for (int i = 1; i < n; i++)
    {
        f[i] = f[i - 1] * a + (i >= 2 ? f[i - 2] : 0);
    }
    vector<double> X(n);
    X[0] = X1;
    X[1] = (Xn - X1 * f[n - 1]) / f[n - 2] + X1 * a;
    for (int i = 2; i < n; i++)
    {
        X[i] = X[i - 1] * a + X[i - 2] * b;
    }
    cout << fixed << setprecision(10);
    for (int i = 0; i < n; i++)
    {
        cout << X[i] << "\n";
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int _ = 1;
    // cin >> _;
    while (_--)
        solve();

    return 0;
}