; 与えられた Ci を昇順ソートして小さいものから足し続ける
; m を超えたときのインデックスを出力する

; 【解1】for ループ
(defun main ()
  (let* ((n (read))
         (m (read))
         (xs (sort (loop repeat n collect (read)) #'<)))
    (loop for i below n
          for s = (car xs) then (+ s (nth i xs))
          until (> s m)
          finally (princ i))
    (terpri)))
(main)

; 【解2】再帰
; (defun scanl (fn init xs)
;   (if (null xs)
;       (list init)
;     (cons init (scanl fn (funcall fn (car xs) init) (cdr xs)))))
; (defun main ()
;   (let* ((n (read))
;          (m (read))
;          (xs (sort (loop repeat n collect (read)) #'<)))
;     (princ (length (remove-if #'plusp (map 'list (lambda (x) (- x m)) (scanl #'+ (car xs) xs)))))
;     (terpri)))
; (main)