import sys
from itertools import permutations
import heapq

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N,K = mi()
A = li()
A.sort()

cnt = 0
for a in A:
    if K >= a:
        K -= a
        cnt += 1

print(cnt,K)