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
#include <bits/stdc++.h>
using namespace std;
int ans,n,x,s;
int a[110];
int main()
{
	scanf("%d%d", &n, &x);
	for (int i=1;i<=n;i++)
		scanf("%d", &a[i]);
	sort(a+1,a+n+1);
	s = 0;
	ans = 0;
	for (int i=1;i<n;i++)
	{
		s += a[i];
		if (s > x) 
			break;
		ans++;
	}
	if (s + a[n] == x) ans++;
	printf("%d\n", ans);
}	