// define me AcrossTheSky
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <ctime>
#include <queue>
using namespace std;
typedef long long ll;
int v[1000000];

int main(){
    int cas; cin >> cas;

    while (cas--){
        int n,bag;
        scanf("%d%d",&n,&bag);
        for (int i=1;i<=n;i++) scanf("%d",&v[i]);
        sort(v+1,v+1+n);
        int i=1,total=0;
        while (i<=n){
            if (total+v[i]<=bag) total+=v[i],i++;
            else break;
        }
        //if (i==n+1) i--;
        i--;
        cout << i << endl;
    }
}