B'You are given an array s consisting of n integers. You have to find any array t of length k such that you can cut out maximum number of copies of array t from array s . Cutting out the copy of t means that for each element t_i of array t you have to find t_i in s and remove it from s . If for some t_i you cannot find such element in s , then you cannot cut out one more copy of t . The both arrays can contain duplicate elements. For example, if s = [1, 2, 3, 2, 4, 3, 1] and k = 3 then one of the possible answers is t = [1, 2, 3] . This array t can be cut out 2 times. Your task is to find such array t that you can cut out the copy of t from s maximum number of times. If there are multiple answers, you may choose any of them. The first line of the input contains two integers n and k ( 1 <= k <= n <= 2 cdot 10^5 ) -- the number of elements in s and the desired number of elements in t , respectively. The second line of the input contains exactly n integers s_1, s_2, ... , s_n ( 1 <= s_i <= 2 cdot 10^5 ). Print k integers -- the elements of array t such that you can cut out maximum possible number of copies of this array from s . If there are multiple answers, print any of them. The required array t can contain duplicate elements. All the elements of t ( t_1, t_2, ... , t_k ) should satisfy the following condition: 1 <= t_i <= 2 cdot 10^5 . The first example is described in the problem statement. In the second example the only answer is [7, 3, 1, 3] and any its permutations. It can be shown that you cannot choose any other array such that the maximum number of copies you can cut out would be equal to 2 . In the third example the array t can be cut out 5 times. '...