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.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    Main m = new Main(sc);
    m.show(m.solve());
  }

  Scanner sc;
  int N;
  int x;
  int[] a;
  int max;

  // 標準入力用のコンストラクタ
  public Main(Scanner sc) {
    this.sc = sc;
    N = sc.nextInt();
    x = sc.nextInt();
    a = new int[N];
    for (int i = 0; i < N; ++i){
        a[i] = sc.nextInt();
    }
  }

  // 判定処理
  int solve() {
      Arrays.sort(a);
      int count = 0;
      boolean over = false; //xより多くキャンディを渡さないと喜ばせられない子供がいるか
      
      for (int i = 0; i < N; ++i){
        if (a[i] <= x){   //a[i]がxより大きいと、そのi番目の子供を喜ばせることはできない
            ++count;
            x -= a[i];
        } else {
           over = true;
           break;   //昇順にソートされているため、オーバーした子供がいる時点で終了
        }
      }
      
      if (x > 0 && over == false){  //キャンディが余り、かつオーバーした子供がいない場合(全員喜ばせることができる)→2回以上配れる子供が発生するため1減らす
        count--;
      }
      
      max = count;
      return max;
  }

  // 回答の表示
  void show(int max) {
        System.out.println(max);
  }
    
}