LunchBox

문제

You are the manager of a restaurant. You prepare N lunch boxes and hope to distribute them to some schools. Suppose there are m schools and assume the ith school asks for k_i lunch boxes.

You aim to distribute the lunch boxes to as many schools as possible. Moreover, you have a rule. For the ith school, you give either zero or k_i lunch boxes. Can you make a program that help you to find the maximum number of schools that can receive lunch boxes?

입력

Your program must read from standard input. The first line contains 2 integers, N and m. Then, it follows by m lines. The ith line contains an integer k_i.

출력

Your program must output one line with a single integer to the standard output, which is the maximum number of schools.