#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
long long t1, t2, x1, x2, t0;
long long ansy1, ansy2;
long long ansUp, ansDn;
bool valid(long long y1, long long y2) {
  long long a = t1 * y1 + t2 * y2;
  long long b = t0 * (y1 + y2);
  return a >= b;
}
void update(long long y1, long long y2) {
  long long tempUp = (t1 * y1 + t2 * y2);
  long long tempDn = (y1 + y2);
  if (tempUp < t0 * tempDn) return;
  if (tempUp * ansDn <= ansUp * tempDn) {
    ansUp = tempUp;
    ansDn = tempDn;
    ansy1 = y1;
    ansy2 = y2;
  } else if (tempUp * ansDn == ansUp * tempDn) {
    if ((y1 + y2) >= (ansy1 + ansy2)) {
      ansy1 = y1;
      ansy2 = y2;
    }
  }
}
int main() {
  cin >> t1 >> t2 >> x1 >> x2 >> t0;
  ansUp = max(t1, t2), ansDn = 1;
  ansy1 = ansy2 = 0;
  for (long long y2 = 0; y2 <= x2; y2++) {
    long long lo = 0, hi = x1;
    while (lo < hi) {
      long long md = (lo + hi) / 2 + 1;
      if (valid(md, y2))
        lo = md;
      else
        hi = md - 1;
    }
    update(lo, y2);
  }
  cout << ansy1 << " " << ansy2 << endl;
  return 0;
}
