#include <bits/stdc++.h>
using namespace std;
constexpr int N = 3e3 + 1;
constexpr long long inf = LLONG_MAX;
constexpr long long MOD = 1e9 + 7;
constexpr double PI = 3.14159265359;
long double ans[4], t[3];
long double res(int i, int id) {
  long double Ans = (long double)(t[0] * i + t[1] * id) / (i + id);
  if (Ans - t[2] >= 0) {
    return Ans - t[2];
  } else
    return inf;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int x1, x2;
  ans[3] = inf;
  cin >> t[0] >> t[1] >> x1 >> x2 >> t[2];
  for (int i = 0; i <= x1; i++) {
    int id = 0;
    for (int l = 0, r = x2, itr = 0; l < r && itr < 300; itr++) {
      int mid = (l + r) / 2;
      if ((long long)(mid * t[1] + i * t[0]) <= (long long)t[2] * (i + mid)) {
        l = mid + 1;
        id = mid;
      } else {
        r = mid - 1;
      }
    }
    while (id <= x2 && (res(i, id)) >= (res(i, id + 1))) {
      id++;
    }
    while (id > x2) {
      id--;
    }
    if (ans[3] >= res(i, id)) {
      if (ans[0] < i + id || ans[3] > res(i, id)) {
        if (ans[3] > res(i, id)) ans[3] = res(i, id);
        ans[0] = i + id;
        ans[1] = i;
        ans[2] = id;
      }
    }
  }
  cout << (int)ans[1] << " " << (int)ans[2];
  return 0;
}
