CF723C Polycarp at the Radio

Polycarp is a music editor at the radio station. He received a playlist for tomorrow, that can be represented as a sequence $ a_{1},a_{2},...,a_{n} $ , where $ a_{i} $ is a band, which performs the $ i $ -th song. Polycarp likes bands with the numbers from $ 1 $ to $ m $ , but he doesn't really like others. We define as $ b_{j} $ the number of songs the group $ j $ is going to perform tomorrow. Polycarp wants to change the playlist in such a way that the minimum among the numbers $ b_{1},b_{2},...,b_{m} $ will be as large as possible. Find this maximum possible value of the minimum among the $ b_{j} $ ( $ 1

The first line of the input contains two integers $ n $ and $ m $ ( $ 1

In the first line print two integers: the maximum possible value of the minimum among the $ b_{j} $ ( $ 1

In the first sample, after Polycarp's changes the first band performs two songs ( $ b_{1}=2 $ ), and the second band also performs two songs ( $ b_{2}=2 $ ). Thus, the minimum of these values equals to $ 2 $ . It is impossible to achieve a higher minimum value by any changes in the playlist. In the second sample, after Polycarp's changes the first band performs two songs ( $ b_{1}=2 $ ), the second band performs three songs ( $ b_{2}=3 $ ), and the third band also performs two songs ( $ b_{3}=2 $ ). Thus, the best minimum value is $ 2 $ .