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

using ll = long long;
using ld = long double;

#define all(a) begin(a), end(a)
#define len(a) int((a).size())

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    ld a, b;
    cin >> a >> b;

    int n;
    cin >> n;

    vector<ld> x(n);
    cin >> x[0] >> x[n - 1];

    if (n > 2) {
        vector<pair<ld, ld>> pres(n); // k * x[1] + b
        pres[0] = {0, x[0]};
        pres[1] = {1, 0};
        for (int i = 2; i < n; i++) {
            pres[i].first = pres[i - 1].first * a + pres[i - 2].first * b;
            pres[i].second = pres[i - 1].second * a + pres[i - 2].second * b;
        }

        ld diff = x[n - 1] - pres[n - 1].second;
        if (fabs(diff) > 1e-9) {
            x[1] = diff / pres[n - 1].first;
        }

        for (int i = 2; i < n; i++) {
            x[i] = x[i - 1] * a + x[i - 2] * b;
        }
    }

    for (auto x : x) {
        cout << x << '\n';
    }
}