No tag edit access

A. Hot Bath

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputBob 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*_{1}, and the hot water's temperature is *t*_{2}. The cold water tap can transmit any integer number of water units per second from 0 to *x*_{1}, inclusive. Similarly, the hot water tap can transmit from 0 to *x*_{2} water units per second.

If *y*_{1} water units per second flow through the first tap and *y*_{2} water units per second flow through the second tap, then the resulting bath water temperature will be:

Bob wants to open both taps so that the bath water temperature was not less than *t*_{0}. 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*_{1}, *t*_{2}, *x*_{1}, *x*_{2} and *t*_{0} (1 ≤ *t*_{1} ≤ *t*_{0} ≤ *t*_{2} ≤ 10^{6}, 1 ≤ *x*_{1}, *x*_{2} ≤ 10^{6}).

Output

Print two space-separated integers *y*_{1} and *y*_{2} (0 ≤ *y*_{1} ≤ *x*_{1}, 0 ≤ *y*_{2} ≤ *x*_{2}).

Examples

Input

10 70 100 100 25

Output

99 33

Input

300 500 1000 1000 300

Output

1000 0

Input

143 456 110 117 273

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.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/26/2017 12:05:41 (c4).

Desktop version, switch to mobile version.

User lists

Name |
---|