#include <bits/stdc++.h>
int t1, t2, x1, x2, t0;
long long f(long long y1, long long y2) {
  return (t2 - t0) * y2 - (t0 - t1) * y1;
}
long long f2(long long resy1, long long resy2, long long y1, long long y2) {
  return (resy1 + resy2) * (t1 * y1 + t2 * y2) -
         (y1 + y2) * (t1 * resy1 + t2 * resy2);
}
int ef(int y2) {
  int m, lt = 0, rt = x1;
  while (lt <= rt) {
    m = (lt + rt) >> 1;
    if (f(m, y2) < 0) {
      rt = m - 1;
    } else {
      lt = m + 1;
    }
  }
  return rt;
}
void solve() {
  int y1, y2, resy1, resy2;
  long long tmp;
  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 {
    resy1 = -1;
    for (y2 = 0; y2 <= x2; y2++) {
      y1 = ef(y2);
      tmp = f2(resy1, resy2, y1, y2);
      if (y1 + y2 > 0 &&
          (resy1 == -1 || tmp < 0 || tmp == 0 && y1 + y2 > resy1 + resy2)) {
        resy1 = y1;
        resy2 = y2;
      }
    }
    printf("%d %d\n", resy1, resy2);
  }
}
int main() {
  while (scanf("%d%d%d%d%d", &t1, &t2, &x1, &x2, &t0) != EOF) {
    solve();
  }
  return 0;
}
