CF332B Maximum Absurdity

Reforms continue entering Berland. For example, during yesterday sitting the Berland Parliament approved as much as $ n $ laws (each law has been assigned a unique number from 1 to $ n $ ). Today all these laws were put on the table of the President of Berland, G.W. Boosch, to be signed. This time mr. Boosch plans to sign $ 2k $ laws. He decided to choose exactly two non-intersecting segments of integers from 1 to $ n $ of length $ k $ and sign all laws, whose numbers fall into these segments. More formally, mr. Boosch is going to choose two integers $ a $ , $ b $ $ (1

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

Print two integers $ a $ , $ b $ — the beginning of segments that mr. Boosch should choose. That means that the president signs laws with numbers from segments $ [a; a+k-1] $ and $ [b; b+k-1] $ . If there are multiple solutions, print the one with the minimum number $ a $ . If there still are multiple solutions, print the one with the minimum $ b $ .

In the first sample mr. Boosch signs laws with numbers from segments \[1;2\] and \[4;5\]. The total absurdity of the signed laws equals $ 3+6+1+6=16 $ . In the second sample mr. Boosch signs laws with numbers from segments \[1;2\] and \[3;4\]. The total absurdity of the signed laws equals $ 1+1+1+1=4 $ .