Boris and Berta#11133
Boris is making a quest for his sister Berta. One of the tasks is to find a point on the map that is meters to the north from their house. But it's too easy if is specified directly. Boris decided to use miles and cables to specify the distance.
He found out that there are a lot of different miles: from a -meter Chinese mile (called li) up to a -meter Norwegian mile (called mil). And a cable length can be anywhere from to meters.
Boris decided to use an -meter mile and a -meter cable. Now he wants to represent the -meter distance as " miles and cables" with non-negative integers and as precisely as possible — that is, he wants to minimize |M\cdot m+C\cdot c-n|. Help him!
Three lines contain an integer each: — the distance to represent, — the chosen length of a mile, and — the chosen length of a cable (1 \le n \le 10^9; 500 \le m \le 11\,299; 169 \le c \le 220). All values are given in meters.
Print two non-negative integers and — the best approximation for the distance of meters using the chosen mile and cable lengths. If there are multiple best approximations, print any of them.
Example 1
Example 2
There are two correct answers to the second example test: "1 6" and "3 1".