import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#n = int(input())
#
#alist = []
#s = input()
n,k = map(int,input().split())
#for i in range(n):
#    alist.append(list(map(int,input().split())))
alist = list(map(int,input().split()))
alist.append(10**18)
alist.sort()
temp = 0
ans = 0
for i in alist:
    if temp + i <= k:
        temp += i
        ans += 1
    else:
        print(ans,k-temp)
        break