402797: GYM100883 H tourists

On one of the Caribbean Islands there are N tourists and you want to move them from this island to another one.

There are only two boats on this island, the first one can hold n₁ tourists and cost c₁ to move exactly n₁ tourists from one Island to another, and the second one can hold n₂ and cost c₂.

The boat will not sail unless it is fully booked. Moreover, you want to minimize the total cost of moving all tourists from one island to another. You can use any boat several times.

The input may contain multiple test cases. Each test case begins with a line containing an integer N (1 ≤ N ≤ 2 * 10⁹).

The second line contains c₁ and n₁, and the third line contains c₂ and n₂.

Here, c₁, c₂, n₁ and n₂ are all positive integers having values smaller than 2 * 10⁹.

A test case containing a zero for N in the first line terminates the input.

For each test case in the input, print a line containing the minimum cost solution: two non-negative integers m₁ and m₂, where m₁ is the number of times to use the first boat, and m₂ is the number of times to use the second boat) if one exists.

Print "failed" otherwise. If a solution exists, you may assume that it is unique.

43
1 3
2 4
40
5 9
5 12
0

13 1
failed