#include <bits/stdc++.h>
#define DEBUG 1
using namespace std;

// Defines
#define fs first
#define sn second
#define pb push_back
#define eb emplace_back
#define mpr make_pair
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
// Basic type definitions
#if __cplusplus == 201703L // CPP17 only things
template <typename T> using opt_ref = optional<reference_wrapper<T>>; // for some templates
#endif
using ll = long long; using ull = unsigned long long; using ld = long double;
using pii = pair<int, int>; using pll = pair<long long, long long>;
#undef __GNUG__
#ifdef __GNUG__
// PBDS order statistic tree
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T, class comp = less<T>> using os_tree = tree<T, null_type, comp, rb_tree_tag, tree_order_statistics_node_update>;
template <typename K, typename V, class comp = less<K>> using treemap = tree<K, V, comp, rb_tree_tag, tree_order_statistics_node_update>;
// HashSet
#include <ext/pb_ds/assoc_container.hpp>
template <typename T, class Hash> using hashset = gp_hash_table<T, null_type, Hash>;
template <typename K, typename V, class Hash> using hashmap = gp_hash_table<K, V, Hash>;
const ll RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash { ll operator()(ll x) const { return x ^ RANDOM; } };
#endif
// More utilities
int SZ(string &v) { return v.length(); }
template <typename C> int SZ(C &v) { return v.size(); }
template <typename C> void UNIQUE(vector<C> &v) { sort(v.begin(), v.end()); v.resize(unique(v.begin(), v.end()) - v.begin()); }
template <typename T, typename U> void maxa(T &a, U b) { a = max(a, b); }
template <typename T, typename U> void mina(T &a, U b) { a = min(a, b); }
const ll INF = 0x3f3f3f3f, LLINF = 0x3f3f3f3f3f3f3f3f;

ld A, B;
int n;

pair<ld, ld> scale(pair<ld, ld> p, ld alpha) {
    return {p.fs * alpha, p.sn * alpha};
}

pair<ld, ld> add(pair<ld, ld> a, pair<ld, ld> b) {
    return {a.fs + b.fs, a.sn + b.sn};
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> A >> B >> n;
    vector<ld> X(n + 1);
    cin >> X[1] >> X[n];

    // derive X[1..n] in terms of X[1] and X[2]
    vector<pair<ld, ld>> coeffs(n + 1); // coeffs[i] = (a, b) where X[i] = a * X[1] + b * X[2]
    coeffs[1] = {1, 0};
    coeffs[2] = {0, 1};
    for (int i = 3; i <= n; i++) {
        coeffs[i] = add(scale(coeffs[i - 1], A), scale(coeffs[i - 2], B));
    }

    // use it to reconstruct X[2] from X[1] and X[n]
    auto [alpha, beta] = coeffs[n];
    X[2] = (X[n] - alpha * X[1]) / beta;

    // reconstruct X[3..n] from X[1] and X[2]
    for (int i = 3; i <= n; i++) {
        X[i] = A * X[i - 1] + B * X[i - 2];
    }

    // output
    cout << fixed << setprecision(10);
    for (int i = 1; i <= n; i++) {
        cout << X[i] << '\n';
    }

    return 0;
}