import sys

def can_assign(tasks, m, T):
    tasks_sorted = sorted(tasks, reverse=True)
    bins = [0] * m

    def backtrack(index):
        if index == len(tasks_sorted):
            return True
        current = tasks_sorted[index]
        for i in range(m):
            if bins[i] + current > T:
                continue
            if i > 0 and bins[i] == bins[i-1]:
                continue
            bins[i] += current
            if backtrack(index + 1):
                return True
            bins[i] -= current
        return False
    return backtrack(0)

def main():
    T = int(sys.stdin.readline())
    N = int(sys.stdin.readline())
    tasks = []
    for _ in range(N):
        tasks.append(int(sys.stdin.readline()))
    S = sum(tasks)
    k = sum(1 for t in tasks if t > T / 2)
    m0 = max((S + T - 1) // T, k)
    tasks_sorted = sorted(tasks, reverse=True)
    for m in range(m0, N + 1):
        if can_assign(tasks_sorted, m, T):
            print(m)
            return
    print(N)  # This line is theoretically unreachable

if __name__ == "__main__":
    main()