//by 72
#include<bits/stdc++.h>
#define F(i, a, b) for(int i = a; i <= b; i ++)
#define Fd(i, a, b) for(int i = a; i >= b; i --)
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define int long long
using namespace std;

const int mod = 998244353;
const int N = 2e5 + 10;
const int inf = 1e18;
typedef array<int, 3> a3; 
typedef long long ll;

int n;
double A, B, x1, xn;
const double eps = 1e-8;
double f[20];

double cal(double x) {
    f[1] = x1, f[2] = x;
    F(i, 3, n) f[i] = A * f[i - 1] + B * f[i - 2];
    return f[n];
}

void sol() {
    cout << fixed << setprecision(20);
    cin >> A >> B;
    cin >> n >> x1 >> xn;
    if(n == 2) {
        cout << x1 << "\n" << xn << "\n";
        return;
    }
    double l = -10000, r = 10000;
    while(r - l > eps) {
        double mid = (r + l) / 2;
        if(cal(mid) < xn) l = mid;
        else r = mid;
    }
    f[1] = x1, f[2] = l;
    F(i, 3, n) f[i] = A * f[i - 1] + B * f[i - 2];
    F(i, 1, n) cout << f[i] << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    F(i, 1, t) sol();
    return 0;
}
//sldl