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 java.util.Scanner;

public class Main {
	public static void main(String args[]) {
		Scanner scn = new Scanner(System.in);
		int N = scn.nextInt();
		long K = scn.nextLong();
		long[] X = new long[N];
		for(int i = 0;i < N;i++) {
			X[i] = scn.nextLong();
		}

		for(int i = 0;i < N;i++) {
			for(int j = i+1;j < N;j++) {
				if(X[i] > X[j]) {
					long buf = X[i];
					X[i] = X[j];
					X[j] = buf;
				}
			}
		}
		int ans = 0;
		for(int i = 0;i < N;i++) {
			if(K - X[i] < 0) {
				K -= X[i];
				break;
			}
			ans++;
			K -= X[i];
		}
		if(K>0)ans--;

		System.out.println(ans);
		scn.close();
	}
}
