B"Your friend has recently learned about coprime numbers. A pair of numbers {a, xe2 x80 x89b} is called coprime if the maximum number that divides both a and b is equal to one. Your friend often comes up with different statements. He has recently supposed that if the pair (a, xe2 x80 x89b) is coprime and the pair (b, xe2 x80 x89c) is coprime, then the pair (a, xe2 x80 x89c) is coprime. You want to find a counterexample for your friend's statement. Therefore, your task is to find three distinct numbers (a, xe2 x80 x89b, xe2 x80 x89c), for which the statement is false, and the numbers meet the condition l xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89a xe2 x80 x89< xe2 x80 x89b xe2 x80 x89< xe2 x80 x89c xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r. More specifically, you need to find three numbers (a, xe2 x80 x89b, xe2 x80 x89c), such that l xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89a xe2 x80 x89< xe2 x80 x89b xe2 x80 x89< xe2 x80 x89c xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r, pairs (a, xe2 x80 x89b) and (b, xe2 x80 x89c) are coprime, and pair (a, xe2 x80 x89c) is not coprime. The single line contains two positive space-separated integers l, r (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89l xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891018; r xe2 x80 x89- xe2 x80 x89l xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8950). Print three positive space-separated integers a, b, c -- three distinct numbers (a, xe2 x80 x89b, xe2 x80 x89c) that form the counterexample. If there are several solutions, you are allowed to print any of them. The numbers must be printed in ascending order. If the counterexample does not exist, print the single number -1. In the first sample pair (2, xe2 x80 x894) is not coprime and pairs (2, xe2 x80 x893) and (3, xe2 x80 x894) are. In the second sample you cannot form a group of three distinct integers, so the answer is -1. In the third sample it is easy to see that numbers 900000000000000009 and 900000000000000021 are divisible by three. "...