#include <bits/stdc++.h>

using namespace std;

//#define MULTITEST

#define x first
#define y second
#define mp make_pair
#define pb push_back
#define sqr(a) ((a) * (a))
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define forn(i, n) for(int i = 0; i < int(n); i++) 
#define fore(i, l, r) for(int i = int(l); i < int(r); i++)

typedef long long li;
typedef long double ld;
typedef pair<int, int> pt;

template <class A, class B> ostream& operator << (ostream& out, const pair<A, B> &a) {
	return out << "(" << a.x << ", " << a.y << ")";
}

template <class A> ostream& operator << (ostream& out, const vector<A> &v) {
	out << "[";
	forn(i, sz(v)) {
		if(i) out << ", ";
		out << v[i];
	}
	return out << "]";
}

mt19937 rnd(time(NULL));

const int INF = int(1e9);
const li INF64 = li(1e18);
const int MOD = int(1e9) + 7;
const ld EPS = 1e-9;
const ld PI = acos(-1.0);

ld a, b;
int n, x1, xn;

bool read () {
	string A, B;
	if (!(cin >> A >> B >> n >> x1 >> xn))
		return false;
	a = stold(A.c_str());
	b = stold(B.c_str());
	return true;
}

ld x[11];

ld f(ld m){
	x[0] = x1;
	x[1] = m;
	fore(i, 2, n) x[i] = x[i - 2] * a + x[i - 1] * b;
	return x[n - 1];
}

void solve() {
	ld l = -INF, r = INF;
	forn(_, 200){
		ld m = (l + r) / 2;
		if (f(m) > xn)
			r = m;
		else
			l = m;
	}
	f((l + r) / 2);
	forn(i, n) cout << x[i] << '\n';
}

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
	
	int tt = clock();
	
#endif
	
	cerr.precision(15);
	cout.precision(15);
	cerr << fixed;
	cout << fixed;
	cin.tie(0);
	ios::sync_with_stdio(false);

#ifdef MULTITEST
	int tc;
	cin >> tc;
	while(tc--){
		read();
#else
	if(read()) {	
#endif
		solve();
		
#ifdef _DEBUG
	cerr << "TIME = " << clock() - tt << endl;
	tt = clock();
#endif

	}
}