There are N children, numbered 1, 2, ..., N.

Snuke has decided to distribute x sweets among them. He needs to give out all the x sweets, but some of the children may get zero sweets.

For each i (1 \leq i \leq N), Child i will be happy if he/she gets exactly a_i sweets. Snuke is trying to maximize the number of happy children by optimally distributing the sweets. Find the maximum possible number of happy children.

Constraints

* All values in input are integers.
* 2 \leq N \leq 100
* 1 \leq x \leq 10^9
* 1 \leq a_i \leq 10^9

Input

Input is given from Standard Input in the following format:


N x
a_1 a_2 ... a_N


Output

Print the maximum possible number of happy children.

Examples

Input

3 70
20 30 10


Output

2


Input

3 10
20 30 10


Output

1


Input

4 1111
1 10 100 1000


Output

4


Input

2 10
20 20


Output

0
import sys
from collections import deque
import copy

from math import *

def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N, x] = [int(input_raw[0]), int(input_raw[1])]
    A = []
    A_dic = {}
    input_raw = read_func().strip().split()
    for i in range(N):

        a = int(input_raw[i])
        A.append(a)
        if a in A_dic:
            A_dic[a] += 1
        else:
            A_dic[a] = 1
    A.sort()
    max_count = 0
    for i in range(N):
        count = 0
        x_tmp = x
        for j in range(i, N):
            if x_tmp - A[j] >= 0:
                if j < N - 1:
                    count += 1
                else:
                    if x_tmp == A[j]:
                        count += 1
            x_tmp -= A[j]
        #if x_tmp == 0:
        max_count = max(max_count, count)


    print max_count



if __name__ == '__main__':
    main()
