#include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
const long long N = 4e5 + 5;
const long long mod = 1e9 + 7;
const long long INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
long long test = 1, t1, t2, x1, x2, t0;
long double ans = INFi;
pair<long long, long long> val;
long double check(long long y1, long long y2) {
  if (y1 + y2 == 0) return 0;
  return (long double)(t1 * y1 + t2 * y2) / (y1 + y2);
}
void bs(long long y1) {
  int l = 0;
  int r = x2;
  while (l <= r) {
    int mid = (l + r) / 2;
    long double t = check(y1, mid);
    if (t >= t0) {
      if (ans >= t) {
        ans = t;
        val = {y1, mid};
      }
      if (t != t0)
        r = mid - 1;
      else
        l = mid + 1;
    } else
      l = mid + 1;
  }
}
void solve() {
  cin >> t1 >> t2 >> x1 >> x2 >> t0;
  for (int i = 0; i <= x2; i++) {
    long double t = check(0, i);
    if (t >= t0) {
      if (ans >= t) {
        ans = t;
        val = {0, i};
      }
    }
  }
  for (int i = 1; i <= x1; i++) {
    bs(i);
  }
  cout << val.first << " " << val.second << " "
       << "\n";
  ;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed;
  cout << setprecision(10);
  ;
  for (int i = 1; i <= test; i++) {
    solve();
  }
}
