// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return b < a ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 20;

ld a, b;
int n, x1, xn;
ld m[MAXN], c[MAXN], x[MAXN];

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> a >> b;
    cin >> n >> x1 >> xn;
    c[1] = x1;
    m[2] = 1;
    REP (i, 3, n + 1) {
        c[i] = a * c[i - 1] + b * c[i - 2];
        m[i] = a * m[i - 1] + b * m[i - 2];
    }
    x[1] = x1;
    // m[n] * x[2] + c[n] = xn
    x[2] = (xn - c[n]) / m[n];
    REP (i, 3, n + 1) {
        x[i] = m[i] * x[2] + c[i];
    }
    REP (i, 1, n + 1) {
        cout << setprecision(10) << x[i] << '\n';
    }
}