N, M = map(int, input().split())
C = list(map(int, input().split()))
current = C.copy()

for _ in range(M):
    # Find all indices where current value is positive
    min_val = None
    min_idx = -1
    for i in range(N):
        if current[i] > 0:
            if min_val is None or current[i] < min_val:
                min_val = current[i]
                min_idx = i
    if min_idx == -1:
        break  # This should not happen as per problem constraints
    current[min_idx] -= 1

# Count the number of empty boxes
print(sum(1 for x in current if x == 0))