B'The well-known Fibonacci sequence F_0, F_1, F_2, ldots is defined as follows: Given an increasing arithmetic sequence of positive integers with n elements: (a, a + d, a + 2 cdot d, ldots, a + (n - 1) cdot d) . You need to find another increasing arithmetic sequence of positive integers with n elements (b, b + e, b + 2 cdot e, ldots, b + (n - 1) cdot e) such that: The first line contains three positive integers n , a , d ( 1 <= q n, a, d, a + (n - 1) cdot d < 10^6 ). If no such arithmetic sequence exists, print -1 . Otherwise, print two integers b and e , separated by space in a single line ( 0 < b, e < 2^{64} ). If there are many answers, you can output any of them. In the first test case, we can choose (b, e) = (2, 1) , because F_2 = 1, F_3 = 2, F_4 = 3 . In the second test case, we can choose (b, e) = (19, 5) because: '...