#include <bits/stdc++.h>
using namespace std;
long long x1, x2, t1, t2, t0;
long long bsearch(long long y1) {
  if (y1 == 0) return x2;
  long long low = 0 + (y1 == 0), high = x2;
  while (low < high) {
    long long mid = (low + high) / 2;
    long long left = t0 * (y1 + mid);
    long long right = t1 * y1 + t2 * mid;
    if (left > right)
      low = mid + 1;
    else
      high = mid;
  }
  long long left = t0 * (y1 + low);
  long long right = t1 * y1 + t2 * low;
  if (left > right) return -1;
  return low;
}
int main() {
  while (cin >> t1 >> t2 >> x1 >> x2 >> t0) {
    long long y1 = 0, y2 = 0;
    for (int i = 0; i <= x1; i++) {
      long long sol = bsearch(i);
      if (sol != -1) {
        if (!y1 && !y2) {
          y1 = i, y2 = sol;
          continue;
        }
        long long left = (t1 * y1 + t2 * y2) * (i + sol);
        long long right = (t1 * i + t2 * sol) * (y1 + y2);
        if (left > right || (left == right && (y1 + y2) < (i + sol))) {
          y1 = i, y2 = sol;
        }
      }
    }
    if (t1 == t2) y1 = x1, y2 = x2;
    cout << y1 << " " << y2 << endl;
    ;
  }
  return 0;
}
