#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <set>
#include <list>
#include <queue>
#include <map>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
int a[100100];
int main()
{
    int T,C = 1,n,v;
    //printf("%d\n",2<<1|1);
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&v);
        for(int i = 0; i < n; i++)
            scanf("%d",&a[i]);
        sort(a,a+n);
        long long sum = 0;
        for(int i = 0; i < n; i++)
        {
            sum += a[i];
            if(sum > v)
            {
                printf("%d\n",i);
                break;
            }
            if(i+1 == n)
                printf("%d\n",i+1);
        }
        //printf("%d\n",ans);
    }
    return 0;
}