Mark_and_toys

// https://www.hackerrank.com/challenges/mark-and-toys/problem

#!/bin/python3

import math
import os
import random
import re
import sys

# Complete the maximumToys function below.
def maximumToys(prices, k):
    prices.sort()
    sum = 0
    count = 0
    for i in (prices):
        if(sum>k):
            break
        else:
            print(i)
            if(sum+i < k):
                sum+=i
                count+=1
        #print(sum)
    return count
    

if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    nk = input().split()

    n = int(nk[0])

    k = int(nk[1])

    prices = list(map(int, input().rstrip().split()))

    result = maximumToys(prices, k)

    fptr.write(str(result) + '\n')

    fptr.close()