#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(const pair<int, pair<int, int> > &p1,
                  const pair<int, pair<int, int> > &p2) const {
    return p1.first < p2.first;
  }
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
const long long int N = 500 + 5, inf = 2e18;
void solve() {
  long long int t1, t2, x1, x2, t0;
  cin >> t1 >> t2 >> x1 >> x2 >> t0;
  if (t1 == t0 && t0 == t2) {
    cout << x1 << ' ' << x2 << '\n';
    return;
  }
  long long int diffx = inf, y1 = 0, y2 = 0;
  if (t2 == t0) {
    cout << 0 << ' ' << x2;
    return;
  }
  if (t1 == t0) {
    cout << x1 << ' ' << 0;
    return;
  }
  for (long long int i = (long long int)0; i < (long long int)(x1 + 1); i++) {
    long long int lo = 0, hi = x2;
    long long int s = t1 * i - t0 * i;
    if (t2 - t0 > 0) {
      while (lo + 1 < hi) {
        long long int m = (lo + hi) >> 1;
        if (s + m * (t2 - t0) >= 0)
          hi = m;
        else
          lo = m;
      }
      if (s + hi * (t2 - t0) >= 0) {
        if (diffx > s + hi * (t2 - t0)) {
          diffx = s + hi * (t2 - t0);
          y1 = i;
          y2 = hi;
        } else if (diffx == s + hi * (t2 - t0)) {
          if (y1 + y2 < i + hi) {
            y1 = i;
            y2 = hi;
          }
        }
      }
    } else {
      lo = 1;
      hi = x2 + 1;
      while (lo + 1 < hi) {
        long long int m = (lo + hi) >> 1;
        if (s + m * (t2 - t0) < 0) {
          hi = m;
        } else
          lo = m;
      }
      if (s + lo * (t2 - t0) >= 0) {
        if (diffx > s + lo * (t2 - t0)) {
          diffx = s + lo * (t2 - t0);
          y1 = i;
          y2 = lo;
        } else if (diffx == s + lo * (t2 - t0)) {
          if (y1 + y2 < i + lo) {
            y1 = i;
            y2 = lo;
          }
        }
      }
    }
  }
  if (y1 == 0) {
    cout << 0 << ' ' << x2 << '\n';
    return;
  }
  if (y2 == 0) {
    cout << x1 << " " << 0 << '\n';
    return;
  }
  long long int m1 = x1 / y1, m2 = x2 / y2;
  long long int m = min(m1, m2);
  cout << y1 * m << ' ' << y2 * m << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
