def maximumToys(prices, k):
    prices.sort()
    for i in range(len(prices)+1):
        if(sum(prices[0:i])<k):
            pass
        elif(sum(prices[0:i])>k):
            return i-1
        elif(sum(prices[0:i])==k):
            return i