> #include <iostream>
> #include <stdlib.h>
> using namespace std;
> 
> int cmp ( const void *a , const void *b )
> {
> 	return *(int *)a - *(int *)b;
> }
> 
> int main()
> {
> 	int t, a[100000];
> 	int i, count;
> 	long int n, s, sum;
> 	scanf("%d", &t);
> 	while (t--)
> 	{
> 		count = 0;
> 		sum   = 0;
> 		scanf("%ld %ld", &n, &s);
> 		for (i =0; i < n; i++ )
> 			scanf("%d", &a[i]);
> 		qsort(a, n, sizeof(a[0]), cmp);
> 		for (i = n-1; i >= 0; i--)
> 		{
> 			sum += a[i];
> 			count ++;
> 			if(sum >= s)
> 			{
> 				printf("%d\n", count);
> 				break;
> 			}
> 		}
> 		if (s > sum) printf("%d\n", 0);
> 	}
> 	return 0;
> }