#include <stdio.h>
#include <algorithm>
using namespace std;

#define max_num 100005
int v[max_num], V, n;

int main()
{
    int T, i, ans; scanf("%d", &T);
    while (T--)
    {
        scanf("%d %d", &n, &V);
        for (i = 0; i < n; i++)
            scanf("%d", &v[i]);
        sort(v, v+n);
        ans = 0;
        for (i = 0; i < n; i++)
        {
            ans += v[i];
            if (ans > V) break;
        }
        printf("%d\n", i);
    }
}