#include<bits/stdc++.h>

using namespace std;

// #define int long long

struct Matrix {
    double a[2][2];
    Matrix() {
        a[0][0] = a[0][1] = a[1][0] = a[1][1] = 0;
    }
    Matrix operator*(Matrix v) {
        Matrix res;
        for(int k = 0; k < 2; k++) {
            for(int i = 0; i < 2; i++)
                for(int j = 0; j < 2; j++)
                    res.a[i][j] += a[i][k] * v.a[k][j];
        }
        return res;
    }
    Matrix operator+(Matrix v) {
        Matrix res;
        for(int i = 0; i < 2; i++)
            for(int j = 0; j < 2; j++)
                res.a[i][j] = a[i][j] * v.a[i][j];
        return res;
    }
};
const int N = 105;
int n;
double A, B, x[N];
Matrix qpow(Matrix a, int b) {
    Matrix res;
    res.a[0][0] = 1; res.a[1][1] = 1;
    while(b) {
        if(b & 1) res = res * a;
        a = a * a; b >>= 1;
    }
    return res;
}
void solve() {
    cin >> A >> B >> n;
    cin >> x[1] >> x[n];
    Matrix m;
    m.a[0][0] = A; m.a[0][1] = B;
    m.a[1][0] = 1;
    m = qpow(m, n - 2);
    x[2] = (x[n] - m.a[0][1] * x[1]) / m.a[0][0];
    for(int i = 1; i <= n; i++) {
        if(i >= 3) x[i] = (x[i - 1] + x[i - 2]);
        cout << fixed << setprecision(10) << x[i] << endl;
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T = 1; 
    // cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}