import sys
sys.setrecursionlimit(1000000000)

#
# Solution Template for Emptying Vaults
# 
# Australian Informatics Olympiad 2026 Invitationals
# 
# This file is provided to assist with reading of input and writing of output
# for the problem. You may modify this file however you wish, or
# you may choose not to use this file at all.
#

# N is the number of vaults, P is their capacity, and K is the time available.
N = 0
P = 0
K = 0
# B contains the coin counts. The list starts from 0.
B = []

# Read N, P, K, and the initial coin counts.
N, P, K = map(int, input().strip().split())
B = list(map(int, input().strip().split()))

# TODO: Compute the maximum number of empty vaults. Coin totals may exceed
# 32-bit integer range.
answer = 0

# Write the answer.
print(answer)