#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, j, k, l, m, n;
  int t1, t0, t2, x1, x2;
  scanf("%d %d %d %d %d", &t1, &t2, &x1, &x2, &t0);
  if (t1 - t2 == 0) {
    printf("%d %d", x1, x2);
    return 0;
  }
  long double bestdiff = 1000000000;
  int besty1, besty2;
  for (int s = 1; s <= x1 + x2; s++) {
    long double y1 = (long double)s * (t0 - t2) / ((long double)t1 - t2);
    long double y2 = s - y1;
    int lim1 = floor(y1);
    for (int yy1 = lim1 - 2; yy1 < lim1 + 2; yy1++) {
      int yy2 = s - yy1;
      if (yy1 >= 0 && yy1 <= x1 && yy2 >= 0 && yy2 <= x2) {
        long double t = (((long double)t1 * yy1 + (long double)t2 * yy2) /
                         ((long double)s));
        if (t >= t0 - 10e-9 && t - t0 <= bestdiff + 10e-9) {
          bestdiff = t - t0;
          besty1 = yy1;
          besty2 = yy2;
        }
      }
    }
  }
  printf("%d %d", besty1, besty2);
  return 0;
}
