Gratitude

Ben heard about studies by Emmons and McCullough that suggest that intentionally practicing gratitude has a lasting effect on people's happiness. Since he wants to be happy too, he decided that at the end of each day he will think back over the past day and write down three things he is thankful for, one thing per line. At the end of $N$ days in which he practiced this exercise, he was curious to know which things appear the most on his list. Help Ben get the $K$ things he was grateful for most frequently.

The input begins with one line containing two space-separated integers, $N$ and $K$, in that order. Then follow $3N$ lines containing Ben's notes from $N$ days. You may assume that the three lines that correspond to the same day contain no repetitions. That is, if you partition the input into $N$ chunks of $3$ consecutive lines, no chunk contains two identical lines.

The output should represent the list of things that Ben is grateful for, ordered by frequency of appearance in Ben's list (with the most frequent item first). In case of two items with equal frequency, the most recent item should appear first. That is, in case of a tie in the number of appearances, the item whose last appearance is later in the input should appear earlier in the output. Finally, if there are more than $K$ different items in Ben's list, your output should contain only the $K$ first items (according to the required order).

• $1 \le K \le 3N \le 100\,000$
• Each input line contains at most $50$ (ASCII) characters.