import sys
sys.setrecursionlimit(1000000000)

#
# Solution Template for Space Mission
# 
# Australian Informatics Olympiad 2021
# 
# 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 available days.
N = 0

# F is the amount of fuel available.
F = 0

# C contains the fuel needed to open a portal on each day.
C = []

answer = 0

# Read the value of N and F.
N, F = map(int, input().strip().split())

# Read the cost to open a portal on each day.
C = [int(input().strip()) for i in range(N)]

# TODO: This is where you should compute your solution. Store the maximum
# number of samples you could collect into the variable answer.

# Write the answer.
print(answer)