def print_result(n,weight_max,package,  weight_array, value_array):
    num = 0
    locate = weight_max -1
    for i in range(n):
        i = n-i-1
        if i==0:
            if package[i][locate] != 0:
                num += 1 
        elif package[i][locate] != package[i-1][locate]:
            locate -= weight_array[i]
            num += 1
    print(num)

def main():
    n, weight_max= map(int,input().split())
    weight_max += 1
    weight_array = []
    value_array = []
    for i in input().split():
        weight_array.append(int(i))
        value_array.append(int(1))
# 本质上package是转移方程, 利用空间换时间和准确度.
    package = [[0 for j in range(weight_max)]for i in range(n)]
    for j in range(weight_max):
        package[0][j] = value_array[0]  if weight_array[0] <= j else 0

    for i in range(1,n):
        for j in range(1,weight_max):
            package[i][j] = max(package[i-1][j], package[i-1][j-weight_array[i]]+value_array[i]) if weight_array[i] <= j else package[i -1][j] 
    print_result( n,weight_max,package, weight_array, value_array)

main()