The Ranger’s Seasonal Guess

A park ranger sees one animal per day. Some animals show up more often in certain seasons, so yesterday’s sightings matter more than those from a long time ago.

Today, the ranger asks you to predict which animal they’ll see today, but you should only look at the last X days of sightings.

The first line of the input contains two integers n and x, where n is the total number of days recorded, and x is the number of most recent days you should consider (1 ≤ x ≤ n).

The second line contains n space-separated animal names (the names don’t contain spaces), listed from oldest to newest.

The program should print the name of the animal that appears most frequently within the last x days. In case there are several equally likely candidates, the program should print the alphabetically smallest one.