#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const long double pi = acos(-1);
const long long int mod = 1e9 + 7;
bool debug = false;
struct fraction {
  long long int num, den;
};
bool operator<(fraction a, fraction b) { return a.num * b.den < a.den * b.num; }
struct node {
  fraction t;
  long long int sum, y1, y2;
};
bool operator<(node a, node b) {
  if (a.t < b.t) return true;
  if (b.t < a.t) return false;
  return a.sum > b.sum;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int t = 1, n, i, j, k, len, x, y, z, c, f, flag, p, q, mx, mn, l, r,
                sum, ans, tmp, it, pos, avg, m, cnt;
  string s;
  char ch;
  vector<long long int> v;
  vector<pair<long long int, long long int>> vec;
  unordered_map<long long int, long long int> mappu;
  pair<long long int, long long int> pr;
  {
    f = 0;
    sum = 0;
    flag = 0;
    ans = 0;
    cnt = 0;
    v.clear();
    mappu.clear();
    vec.clear();
    long long int t1, t2, x1, x2, t0;
    cin >> t1 >> t2 >> x1 >> x2 >> t0;
    if (t0 == t1) {
      cout << x1 << " ";
      if (t2 == t0)
        cout << x2;
      else
        cout << 0;
      return 0;
    }
    long long int y1, y2;
    vector<node> a;
    for (y2 = 0; y2 < x2 + 1; y2++) {
      tmp = (t2 * y2 - y2 * t0) / (t0 - t1);
      y1 = min(x1, tmp);
      if ((t1 * y1 + t2 * y2) / (long double)(y1 + y2) < (long double)t0)
        continue;
      node tp;
      fraction ftp;
      ftp.num = t1 * y1 + t2 * y2;
      ftp.den = y1 + y2;
      tp.t = ftp;
      tp.sum = y1 + y2;
      tp.y1 = y1;
      tp.y2 = y2;
      a.push_back(tp);
    }
    sort(a.begin(), a.end());
    cout << (*a.begin()).y1 << " " << (*a.begin()).y2;
  }
  return 0;
}
