n black and white balls were put into a bag. Petya doesn't know exactly how many black balls are there among them. He knows, however, that there are 0, 1,..., n black balls among all balls in the bag with equal probability.

Petya took l balls from the bag at random, and l₁ of them turned out black, while l₂ other turned out white (l₁ + l₂ = l). Now he wants to predict how many black balls were there initially in the bag. Of course, if l < n, he can't be sure in his prediction, but he wants to predict a segment [a, b], such that the amount k of black balls belongs to it with probability at least p.

You are given n, l₁, l₂ and p, and you must find such a and b that b - a is minimal possible. If there are several such pairs (a, b), choose the one with the smallest a.

In the first line there are four integer numbers: 1 ≤ n ≤ 50 — the number of balls in the bag, 0 ≤ l₁ ≤ n — the number of black balls out of the l balls that Petya took from the bag, 0 ≤ l₂ ≤ n - l₁ — the number of white balls that Petya took from the bag, 0 ≤ p ≤ 100 — the required confidence in percent.

Output numbers a and b separated by a space, 0 ≤ a ≤ b ≤ n.

sample input	sample output
50 1 24 100	1 26

sample input	sample output
50 1 49 100	1 1

sample input	sample output
50 1 10 95	1 15