CF160C Find Pair

You've got another problem dealing with arrays. Let's consider an arbitrary sequence containing $ n $ (not necessarily different) integers $ a_{1} $ , $ a_{2} $ , ..., $ a_{n} $ . We are interested in all possible pairs of numbers ( $ a_{i} $ , $ a_{j} $ ), ( $ 1

The first line contains two integers $ n $ and $ k $ ( $ 1

In the single line print two numbers — the sought $ k $ -th pair.

In the first sample the sorted sequence for the given array looks as: $ (1,1),(1,2),(2,1),(2,2) $ . The $ 4 $ -th of them is pair $ (2,2) $ . The sorted sequence for the array from the second sample is given in the statement. The $ 2 $ -nd pair there is $ (1,3) $ .