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.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String[] tokens = in.nextLine().split(" ");
		int N = Integer.parseInt(tokens[0]);
		long x = Long.parseLong(tokens[1]);
		tokens = in.nextLine().split(" ");
		List<Long> a = new ArrayList<>(N);
		for (int i = 0; i < N; ++i) {
			a.add(Long.parseLong(tokens[i]));
		}
		Collections.sort(a);

		long childrenNum = 0;
		boolean lack = false;
		for (int i = 0; i < N - 1; ++i) {
			if (x - a.get(i) < 0) {
				lack = true;
				break;
			}
			childrenNum++;
			x -= a.get(i);
		}
		if (!lack && x == a.get(N - 1)) {
			childrenNum++;
		}
		if (childrenNum < 0) {
			childrenNum = 0;
		}
		System.out.println(childrenNum);

		in.close();
	}
}