#include <bits/stdc++.h>
using namespace std;
template <typename S, typename T>
void fill_(S& buf, const T& x) {
  fill_n(reinterpret_cast<T*>(&buf), sizeof(buf) / sizeof(T), x);
}
template <typename T, int N>
inline int countof(const T (&)[N]) {
  return N;
}
template <typename T>
inline vector<T>& operator+=(vector<T>& ret, const T& x) {
  ret.push_back(x);
  return ret;
}
long long t1, t2, x1, x2, t0;
void init() { cin >> t1 >> t2 >> x1 >> x2 >> t0; }
int main(int argc, char* argv[]) {
  init();
  long long n_ = t2 * x2, d_ = x2;
  long long y1_ = 0, y2_ = x2;
  if (t1 == t2) {
    y1_ = x1;
  } else {
    for (long long y1 = 1; y1 <= x1; ++y1) {
      long long l = -1, r = x2;
      long long y2 = r;
      while (l + 1 < r) {
        y2 = (l + r) / 2;
        if (t0 * (y1 + y2) <= t1 * y1 + t2 * y2)
          r = y2;
        else
          l = y2;
      }
      y2 = r;
      if (t0 * (y1 + y2) <= t1 * y1 + t2 * y2) {
        long long d = n_ * (y1 + y2) - (t1 * y1 + t2 * y2) * d_;
        if (d > 0 || d == 0 && d_ < y1 + y2) {
          n_ = t1 * y1 + t2 * y2;
          d_ = y1 + y2;
          y1_ = y1;
          y2_ = y2;
        }
      }
    }
  }
  cout << y1_ << ' ' << y2_ << endl;
  return 0;
}
