#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long double ld;
const ld INF = 1e18;
/*
struct edge{
	int to,nxt;
}e[200010];
int nE = 0,hd[200010];
void add(int u,int v){
	e[++nE] = (edge){v,hd[u]};
	hd[u] = ++nE;
}
int fa[200010];
int Find(int i){
	return fa[i] == i ? i : fa[i] = Find(fa[i]);
}
void Unite(int u,int v){
	u = Find(u),v = Find(v);
	if(u == v) return;
	fa[u] = v;
}
int bit[200010];
int LSB(int i){
	return i & (-i);
}
void upd(int i,int v){
	while(i <= n){
		bit[i] += v;
		i += LSB(i);
	}
}
int psq(int i){
	int res = 0;
	while(i){
		res += bit[i];
		i -= LSB(i);
	}
}
*/
ld A,B;
int n;
ld x[11];
signed main(){
	scanf("%Lf %Lf",&A,&B);
	scanf("%lld %Lf",&n,&x[1]);
	scanf("%Lf",&x[0]);
	if(n == 2){
		printf("%.10Lf %.10Lf",x[1],x[0]);
		return 0;
	}
	ld l = -INF,r = INF;
	for(int i = 1; i <= 500; i++){
		ld mid = (l + r) / 2.0;
		x[2] = mid;
		for(int j = 3; j <= n; j++) x[j] = A * x[j - 1] + B * x[j - 2];
		if(x[n] < x[0]) l = mid;
		else r = mid;
	}
	for(int i = 1; i <= n; i++) printf("%.10Lf ",x[i]);
    return 0;
}