#include <bits/stdc++.h>
using namespace std;
struct comparator {
  bool operator()(long long int i, long long int j) { return i > j; }
};
bool sortpair(pair<long long int, long long int> &a,
              pair<long long int, long long int> &b) {
  return (b.first - b.second) > (a.first - a.second);
}
long long int gcd(long long int a, long long int b) {
  if (b < a) {
    int temp = a;
    a = b;
    b = temp;
  }
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
long long int min(long long int a, long long int b) { return a > b ? b : a; }
long long int min(long long int a, long long int b, long long int c) {
  if (a <= b && a <= c) {
    return a;
  } else if (b <= a && b <= c) {
    return b;
  } else {
    return c;
  }
}
long long int max(long long int a, long long int b) { return a > b ? a : b; }
long long int lcm(long long int a, long long int b) {
  return (a * b / gcd(a, b));
}
bool check(long long int first) {
  while (first % 2 == 0) {
    first /= 2;
  }
  while (first % 3 == 0) {
    first /= 3;
  }
  if (first != 1) {
    return false;
  }
  return true;
}
long long int ans(int num, int n) {
  if (n == 1) {
    return num;
  } else if (n == 2) {
    return num + 1;
  } else if (n == 3) {
    return num + 2;
  } else if (n % 3 == 0) {
    return ans(num + 2, (n - 1) / 2);
  } else if (n % 2 == 0) {
    return ans(num + 1, n / 2);
  }
}
vector<long long int> getprimes() {
  vector<long long int> pl(101, 1);
  for (int i = 2; i <= 100; i++) {
    if (pl[i] == 1) {
      for (int j = 2 * i; j <= 100; j += i) {
        pl[j] = 0;
      }
    }
  }
  return pl;
}
long long int ans(int n) {
  if (n == 0) {
    return 1;
  } else if (n == 1 || n == 2) {
    return 0;
  } else if (n < 0) {
    return 0;
  } else {
    return (ans(n - 7) | ans(n - 3));
  }
}
long long int primefactorise(int n) {
  if (n == 1) {
    return 1;
  }
  long long int ans = n;
  while (n % 2 == 0) {
    n = n / 2;
    if (n != 1) {
      ans += n;
    }
  }
  for (int i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      n = n / i;
      if (n != 1) {
        ans += n;
      }
    }
  }
  ans += 1;
  return ans;
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      ans *= a;
      ans = ans % 1000000009;
    }
    b /= 2;
    a *= a;
    a = a % 1000000009;
  }
  return ans % 1000000009;
}
bool check(long long int n, long long int a, long long int b) {
  while (n > 0) {
    if (n % 10 == a || n % 10 == b) {
      n /= 10;
    } else {
      return false;
    }
  }
  return true;
}
long long int dist(int x1, int y1, int x2, int y2) {
  return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
}
long long int product(long long int i) {
  long long int ans = 1;
  while (i > 0) {
    if (i % 10 != 0) {
      ans *= (i % 10);
    }
    i /= 10;
  }
  return ans;
}
bool isvowel(char c) {
  if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' || c == 'y') {
    return true;
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t1, t2, x1, x2, t0;
  cin >> t1 >> t2 >> x1 >> x2 >> t0;
  if (t1 == t2) {
    cout << x1 << " " << x2 << endl;
    return 0;
  } else if (t0 == t2) {
    cout << 0 << " " << x2 << endl;
    return 0;
  } else if (t0 == t1) {
    cout << x1 << " " << 0 << endl;
    return 0;
  }
  long long int max1 = 0, max2 = x2, max = x2;
  double min = t2 - t0;
  for (int i = 1; i <= x1; i++) {
    long long int l = 1, r = x2;
    while (l <= r) {
      long long int mid = (l + r) / 2;
      double temp = (t1 * i * 1.0 + t2 * mid * 1.0) / (i + mid) * 1.0;
      if (temp < t0) {
        l = mid + 1;
      } else if (temp >= t0) {
        if (temp - t0 < min) {
          min = temp - t0;
          max1 = i;
          max2 = mid;
          max = mid + i;
        } else if (temp - t0 == min) {
          if (mid + i > max) {
            max = mid + i;
            max1 = i;
            max2 = mid;
          }
        }
        r = mid - 1;
      }
    }
  }
  cout << max1 << " " << max2 << endl;
}
