#include<cstdio>
#include<cmath>
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include<ctype.h>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<list>
#define INF 0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define FF(i,n) for(int i = 0 ; i < n ; i++)
#define F(i,n) for(int i = 1 ; i <= n ; i++)
#define maxn 100000+10
typedef long long LL;
using namespace std;
int a[maxn];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,v;
        scanf("%d%d",&n,&v);
        F(i,n)
        {
            scanf("%d",&a[i]);
        }
        sort(a+1,a+1+n);
        int cnt=0;
        F(i,n)
        {
            if(a[i]<=v)
            {
                v-=a[i];
                cnt++;
            }
            else break;
        }
        printf("%d\n",cnt);
    }
    return 0;
}