#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

using ld = long double;

const ld INF = 1e9;


int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);

  ld a, b, x1, xn;
  int n;
  cin >> a >> b >> n >> x1 >> xn;
  ld L = -INF, R = INF;
  for (int _ = 0; _ < 100; ++_) {
    ld m = (L + R) / 2;
    ld xi1 = x1;
    ld xi = m;
    for (int i = 3; i <= n; ++i) {
      ld x3 = a * xi + b * xi1;
      xi1 = xi;
      xi = x3;
    }
    if (xi > xn) {
      R = m;
    } else {
      L = m;
    }
  }

  ld x2 = (L + R) / 2;
  cout << fixed << setprecision(20);
  cout << x1 << "\n" << x2 << "\n";
  for (int i = 3; i <= n; ++i) {
    ld x3 = a * x2 + b * x1;
    cout << x3 << "\n";
    x1 = x2;
    x2 = x3;
  }


  
  return 0;
}