#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
 
int main() {
	int t, n, cnt, flag;
	long long m, p[10], s;
	scanf("%d", &t);
	while(t--) {
		memset(p, 0, sizeof(p));
		cnt=0;
		s=0;
		flag=0;
		scanf("%d%lld", &n, &m);
		for(int i=0; i<n; i++) scanf("%lld", &p[i]);
		sort(p, p+n);
		for(int i=n-1; i>=0; i--) {
			s+=p[i];
			cnt++;
			if(s>=m) {
				flag=1;
				break;
			}
		}
		if(flag) printf("%d\n", cnt);
		else printf("-1\n");
	}
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y3N0ZGlvPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8Y3N0cmluZz4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJaW50IHQsIG4sIGNudCwgZmxhZzsKCWxvbmcgbG9uZyBtLCBwWzEwXSwgczsKCXNjYW5mKCIlZCIsICZ0KTsKCXdoaWxlKHQtLSkgewoJCW1lbXNldChwLCAwLCBzaXplb2YocCkpOwoJCWNudD0wOwoJCXM9MDsKCQlmbGFnPTA7CgkJc2NhbmYoIiVkJWxsZCIsICZuLCAmbSk7CgkJZm9yKGludCBpPTA7IGk8bjsgaSsrKSBzY2FuZigiJWxsZCIsICZwW2ldKTsKCQlzb3J0KHAsIHArbik7CgkJZm9yKGludCBpPW4tMTsgaT49MDsgaS0tKSB7CgkJCXMrPXBbaV07CgkJCWNudCsrOwoJCQlpZihzPj1tKSB7CgkJCQlmbGFnPTE7CgkJCQlicmVhazsKCQkJfQoJCX0KCQlpZihmbGFnKSBwcmludGYoIiVkXG4iLCBjbnQpOwoJCWVsc2UgcHJpbnRmKCItMVxuIik7Cgl9CglyZXR1cm4gMDsKfQ==

MQo0IDcKMSAyIDMgNA==

1
4 7
1 2 3 4