Kitchen Utensils

厨房用具 国王的生日晚餐有客人参加。晚餐非常成功：每个人都吃过几道菜（尽管每个人的菜数都是一样的），每道菜都配有一套新的餐具。 王国所有的餐具从11件到100100件都有编号。众所周知，每套餐具都是相同的，并且由不同类型的餐具组成，尽管每种特定类型的餐具可能出现在一组中。例如，一套餐具可以由一个叉子、一个勺子和一把刀组成。 宴会结束后，客人们偷了很多餐具了，国王想知道被偷多少餐具。不幸的是，国王忘记了为每位客人准备了多少餐具，但他知道餐后剩下的所有餐具的清单。你的任务是找到被盗餐具的最少数量。

The king's birthday dinner was attended by $ k $ guests. The dinner was quite a success: every person has eaten several dishes (though the number of dishes was the same for every person) and every dish was served alongside with a new set of kitchen utensils. All types of utensils in the kingdom are numbered from $ 1 $ to $ 100 $ . It is known that every set of utensils is the same and consist of different types of utensils, although every particular type may appear in the set at most once. For example, a valid set of utensils can be composed of one fork, one spoon and one knife. After the dinner was over and the guests were dismissed, the king wondered what minimum possible number of utensils could be stolen. Unfortunately, the king has forgotten how many dishes have been served for every guest but he knows the list of all the utensils left after the dinner. Your task is to find the minimum possible number of stolen utensils.

The first line contains two integer numbers $ n $ and $ k $ ( $ 1 \le n \le 100, 1 \le k \le 100 $ ) — the number of kitchen utensils remaining after the dinner and the number of guests correspondingly. The next line contains $ n $ integers $ a_1, a_2, \ldots, a_n $ ( $ 1 \le a_i \le 100 $ ) — the types of the utensils remaining. Equal values stand for identical utensils while different values stand for different utensils.

Output a single value — the minimum number of utensils that could be stolen by the guests.

5 2
1 2 2 1 3

1

10 3
1 3 3 1 3 5 5 5 5 100

14

In the first example it is clear that at least one utensil of type $ 3 $ has been stolen, since there are two guests and only one such utensil. But it is also possible that every person received only one dish and there were only six utensils in total, when every person got a set $ (1, 2, 3) $ of utensils. Therefore, the answer is $ 1 $ . One can show that in the second example at least $ 2 $ dishes should have been served for every guest, so the number of utensils should be at least $ 24 $ : every set contains $ 4 $ utensils and every one of the $ 3 $ guests gets two such sets. Therefore, at least $ 14 $ objects have been stolen. Please note that utensils of some types (for example, of types $ 2 $ and $ 4 $ in this example) may be not present in the set served for dishes.