#include<iostream>
#include<algorithm>
#include<cstring>
#define N 100005
using namespace std;
int dp[N];
int max(int a, int b) { return a > b ? a : b; }
int main() {
    int t;
    int n, v;
    int ans;
    scanf("%d", &t);
    while (t--) {
        ans = 0;
        scanf("%d %d", &n, &v);
        for (int i = 1; i <= n; i++)
            scanf("%d", &dp[i]);
        sort(dp + 1, dp + 1 + n);
        for (int i = 1; i <= n; i++) {
            if (v > dp[i]) {
                v -= dp[i];
                ans++;
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}