#include<bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
#define LNF 0x3f3f3f3f3f3f3f3f
void W() {} template<class T, class... U> void W(const T &head, const U &... tail) { cerr << "#" << head; cerr << (sizeof...(tail) ? ' ' : '\n'); W(tail...); }
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T, class A>void udp(T &a, A b) { if (a < b)a = b;}
#define pb push_back
void solve(void) {
    long double A, B, X1, Xn;
    ll n;
    cin >> A >> B >> n >> X1 >> Xn;
    std::vector<pair<long double, long double>> ans(n + 3);
    ans[1] = {0, 1};
    ans[2] = {1, 0};
    for (int i = 3; i <= n; i++) {
        long double xa = ans[i - 1].second * A + ans[i - 2].second * B;
        long double xb = ans[i - 1].first * A + ans[i - 2].first * B;
        ans[i] = {xb, xa};
    }
    long double w = (Xn - ans[n].second * X1) / (B*ans[n].first);
    for (int i = 1; i <= n; i++) {
        long double now = ans[i].second * X1 + ans[i].first * w;
        cout << fixed << setprecision(10) << now << "\n";
    }
}
int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int t = 1;
    // cin>>t;
    while (t--)
        solve();
    return 0;
}