#include<cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int a[1000000];
int n,v;
int main()
{
    int i,j,k,l,T;
    scanf("%d", & T);
    while(T--)
    {
        memset(a, 0, sizeof(a));
        scanf("%d %d",&n, &v);
        for(i=1;i<=n;i++)
            scanf("%d",&a[i]);
        sort(a, a + 1 + n);
        i = 1;
        while(v - a[i] >= 0)
        {
            v = v - a[i];
            //printf("%d\n", v);
            i++;
        }
        printf("%d\n", i - 1);
    }
    return 0;
}