#include <bits/stdc++.h>
using namespace std;
const int N = 100001;
int mod = 1000000007;
int min(int a, int b) {
  if (a < b)
    return a;
  else
    return b;
}
int max(int a, int b) {
  if (a > b)
    return a;
  else
    return b;
}
int power(int a, int b) {
  int res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
int gcd(int p, int q) {
  if (p % q == 0)
    return q;
  else {
    return gcd(q, p % q);
  }
}
int mul(int a, int b) { return ((a % mod) * (b % mod)) % mod; }
int sub(int a, int b) { return (((a - b) % mod) + mod) % mod; }
void solve() {
  long double t1, t2, x1, x2, t0;
  cin >> t1 >> t2 >> x1 >> x2 >> t0;
  if (t1 == t0 && t2 != t0) {
    cout << int(x1) << " " << 0;
    return;
  }
  if (t2 == t0 && t1 != t0) {
    cout << 0 << " " << int(x2);
    return;
  }
  if (t1 == t2) {
    cout << int(x1) << " " << int(x2);
    return;
  }
  long double sum = 0;
  long double y1 = -1, y2 = -1;
  long double ans = -1;
  for (long double i = 1; i <= x1; ++i) {
    long double temp = ceil(((t0 - t1) * i) / (t2 - t0));
    if (temp > x2) continue;
    long double ta = (temp * t2 + i * t1) / (i + temp);
    if (ans == -1 || ta < ans) {
      ans = ta;
      sum = i + temp;
      y1 = i;
      y2 = temp;
      continue;
    }
    if (ta == ans) {
      if (sum <= i + temp) {
        sum = i + temp;
        y1 = i;
        y2 = temp;
      }
    }
  }
  if (y1 == -1) {
    cout << 0 << " " << int(x2);
    return;
  }
  cout << int(y1) << " " << int(y2);
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  for (int i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
