#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using ll = long long;

using namespace std;

const double INF = 1e9;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    double A, B;
    int n, X_1, X_n;
    cin >> A >> B >> n >> X_1 >> X_n;

    auto calc = [&](double x) {
        double cur = x, pre = X_1;
        for (int i = 3; i <= n; i++) {
            double nxt = A * cur + B * pre;
            pre = cur;
            cur = nxt;
        }
        return cur;
    };
    double lb = -INF, ub = INF;
    for (int _ = 0; _ < 100; _++) {
        double mid = (lb + ub) / 2;
        (calc(mid) >= X_n ? ub : lb) = mid;
    }
    vector<double> X(n);
    X[0] = X_1, X[1] = ub;
    for (int i = 2; i < n; i++) X[i] = A * X[i - 1] + B * X[i - 2];

    for (auto& val : X) cout << val << '\n';
    return 0;
}