Hot Bath

2000ms

262144K

Description:

Bob is about to take a hot bath.

There are two taps to fill the bath: a hot water tap and a cold water tap. The cold water's temperature is t₁, and the hot water's temperature is t₂. The cold water tap can transmit any integer number of water units per second from 0 to x₁, inclusive. Similarly, the hot water tap can transmit from 0 to x₂ water units per second.

If y₁ water units per second flow through the first tap and y₂ water units per second flow through the second tap, then the resulting bath water temperature will be:

$\text{[math]}$

Bob wants to open both taps so that the bath water temperature was not less than t₀. However, the temperature should be as close as possible to this value. If there are several optimal variants, Bob chooses the one that lets fill the bath in the quickest way possible.

Determine how much each tap should be opened so that Bob was pleased with the result in the end.

Input:

You are given five integers t₁, t₂, x₁, x₂ and t₀ (1 ≤ t₁ ≤ t₀ ≤ t₂ ≤ 10⁶, 1 ≤ x₁, x₂ ≤ 10⁶).

Output:

Print two space-separated integers y₁ and y₂ (0 ≤ y₁ ≤ x₁, 0 ≤ y₂ ≤ x₂).

Sample Input:

10 70 100 100 25

Sample Output:

99 33

Sample Input:

300 500 1000 1000 300

Sample Output:

1000 0

Sample Input:

143 456 110 117 273

Sample Output:

76 54

Note:

In the second sample the hot water tap shouldn't be opened, but the cold water tap should be opened at full capacity in order to fill the bath in the quickest way possible.

Informação

Provedor Codeforces

Código CF126A