def solution():
    m = int(input())
    n = int(input())
    nums = map(int, input().split())
    nums = sorted(nums)
    total = 0
    for i in range(n):
        total += nums[i]
        if total > m:
            return i
            break

    return n


print(solution())