#D2969. Sugar Water

    ID: 2475 Type: Default 3000ms 268MiB

Sugar Water

Sugar Water

Snuke is making sugar water in a beaker. Initially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.

  • Operation 1: Pour 100A grams of water into the beaker.
  • Operation 2: Pour 100B grams of water into the beaker.
  • Operation 3: Put C grams of sugar into the beaker.
  • Operation 4: Put D grams of sugar into the beaker.

In our experimental environment, E grams of sugar can dissolve into 100 grams of water.

Snuke will make sugar water with the highest possible density.

The beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker. Find the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it. If there is more than one candidate, any of them will be accepted.

We remind you that the sugar water that contains a grams of water and b grams of sugar is \frac{100b}{a + b} percent. Also, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.

Constraints

  • 1 \leq A < B \leq 30
  • 1 \leq C < D \leq 30
  • 1 \leq E \leq 100
  • 100A \leq F \leq 3 000
  • A, B, C, D, E and F are all integers.

Inputs

Input is given from Standard Input in the following format:

A B C D E F

Outputs

Print two integers separated by a space. The first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.

Examples

Input

1 2 10 20 15 200

Output

110 10

Input

1 2 1 2 100 1000

Output

200 100

Input

17 19 22 26 55 2802

Output

2634 934

inputFormat

Inputs

Input is given from Standard Input in the following format:

A B C D E F

outputFormat

Outputs

Print two integers separated by a space. The first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.

Examples

Input

1 2 10 20 15 200

Output

110 10

Input

1 2 1 2 100 1000

Output

200 100

Input

17 19 22 26 55 2802

Output

2634 934

样例

1 2 1 2 100 1000
200 100