PROGRAMMING:Xiao Ming's dinner

Xiao Ming has been studying hard recently, so he often forgets to eat. Xiao Ming decided to take a holiday to have a big meal. When he got to the place where he had a meal, Xiao Ming fell into a deep meditation. Because he was very tangled and didn't know what to eat, so he wanted everything. Xiao Ming's food is unlimited and greedy, so he wants to eat all the most expensive meals he can afford. He starts from the most expensive restaurant, and if the money left is not enough to eat the most expensive one, he goes down to find the more expensive one. Until the money is empty or can't afford the cheapest meal. Of course, Xiao Ming is a man of principle. He will never eat the restaurant he has already eaten. But he can't figure out what to eat after learning, and needs your help
(hint: Xiaoming doesn't have any other choice. As long as it's expensive, he will choose the most expensive one, even if the expensive one eats less and the cheap one can eat more.)
###Input format:
Enter a p for Xiaoming's money (1 < = n < = 10000). Enter an n for Xiaoming to have n (1 < = n < = 100) choices. The next N lines contain a string indicating the name of the hotel and the price of eating in the hotel. The string length does not exceed 20.
###Output format:
Output what Xiao Ming can eat, if Xiao Ming can't afford anything, output "Chitu".
###Input example:
```in
10 5
McDonald's 2
KFC 6
Yifan 1
Erfan 3
Sanfan 4
```
###Output example:
```out
KFC
Sanfan
```







answer：If there is no answer, please comment