#include<bits/stdc++.h>
using namespace std;

struct node{
	int c,f;
}a1[100005],a2[100005];
bool cmp(node a,node b) {
	return a.f>b.f;
}
void work() {
	int n,n1=0,n2=0;
	int c,w,f;
	long long m;
	cin>>n>>m;
	
	for(int i=1;i<=n;i++) {
		cin>>c>>w>>f;
		if(w==1) {
			n1++;
			a1[n1].c=c;
			a1[n1].f=f;
		} else {
			n2++;
			a2[n2].c=c;
			a2[n2].f=f;
		}
	}
	sort(a1+1,a1+n1+1,cmp);
	sort(a2+1,a2+n2+1,cmp);
	int l1=1,l2=1;
	long long sum=0,ans=0;
	while(l1<=n1||l2<=n2) {
		if(l1<=n1&&a1[l1].f>a2[l2].f) {
			if(sum==0) ans+=a1[l1].f;
			if(sum+a1[l1].c<=m) {
				sum+=a1[l1].c;
				l1++;
			} else {
				a1[l1].c-=m-sum;
				sum=0;
			}
		} else if(l2<=n2) {
			if(sum==0) ans+=a2[l2].f;
			if(sum+2*a2[l2].c<=m) {
				sum+=2*a2[l2].c;
				l2++;
			} else {
				a2[l2].c-=(m-sum)/2;
				if((m-sum)%2==1) {
					if(l1<=n1) {
						a1[l1].c--;
						if(a1[l1].c==0) l1++;
					}
				}
				sum=0;
			}
		}
	}
	cout<<ans<<"\n";
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--) work();
	return 0;
}