#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T INT_LEN(T v) {
  int len = 1;
  while (v /= 10) ++len;
  return len;
}
int t1, t2, x1, x2, t0;
int less_than(double va, double vb) { return va <= vb + 1e-10; }
int binary_found(int lt, int rt, int y2, double &pre) {
  int y1;
  bool flag = false;
  double t;
  while (lt <= rt) {
    y1 = (lt + rt) >> 1;
    t = ((double)t1 * y1 + (double)t2 * y2) / (y1 + y2);
    if (t >= t0)
      lt = -~y1;
    else
      rt = ~-y1;
  }
  t = ((double)t1 * rt + (double)t2 * y2) / (rt + y2);
  if (less_than(fabs(t - t0), fabs(pre - t0))) {
    flag = true;
    pre = t;
  }
  return flag ? rt : -1;
}
void solve() {
  int i, j, mx = 0;
  int y1, y2;
  if (t1 == t2)
    printf("%d %d\n", x1, x2);
  else if (t0 == t1)
    printf("%d %d\n", x1, 0);
  else if (t0 == t2)
    printf("%d %d\n", 0, x2);
  else {
    double pre = t2;
    y2 = 0;
    for (i = 1; i <= x2; i++) {
      j = binary_found(0, x1, i, pre);
      if (~j && i + j > mx) {
        mx = i + j;
        y1 = j;
        y2 = i;
      }
    }
    printf("%d %d\n", y1, y2);
  }
}
int main(void) {
  while (5 == scanf("%d%d%d%d%d", &t1, &t2, &x1, &x2, &t0)) {
    solve();
  }
  return 0;
}
