eolymp
bolt
Try our new interface for solving problems

Buns

Vassya loves buns very much. Once he had a dream that he was with his class on a tour at confectionery factory. Being there, Vassya managed to get to buns conveyor belt and saw on it \textbf{N} of buns of different kinds (each kind has its identification number at the factory). Vassya decided (as a true buns gourmet) that he will eat the buns only of these kinds that are on the belt no more than \textbf{K} times. You are given \textbf{N} numbers, each of which - the number of types of buns, lying on the conveyor. Identify which buns Vassia will eat. \InputFile In the first line of the input file, two natural numbers are given, \textbf{N} <= \textbf{1000000} - the number of buns on the line and K \textbf{K} <= \textbf{100}. In the second line \textbf{N} numbers are given - the numbers of buns (<= \textbf{1000000}). \OutputFile In the output file to display numbers of all buns, Vassya, sorted in descending order.
Time limit 2 seconds
Memory limit 64 MiB
Input example #1
16 4
6 1 19 6 8 18 2 20 2 11 20 11 6 8 8 4
Output example #1
20 20 19 18 11 11 8 8 8 6 6 6 4 2 2 1
Source SCS 2009