#include <bits/stdc++.h>
using namespace std;
struct node{
    long long int sum,w,h;
}e[200006];
bool cmp(struct node a,struct node b){
    return a.h>b.h;
}
int main()
{
    int t,o=0;
    cin>>t;
    while(t--){
        o++;
        long long int n,m,cnt=0;
        cin>>n>>m;
        for(int i=1;i<=n;i++){
            cin>>e[i].sum>>e[i].w>>e[i].h;
            if(e[i].w%2==0){
                cnt++;
                e[n+cnt].sum=e[i].sum;
                e[n+cnt].w=1;
                e[i].w=1;
                e[n+cnt].h=e[i].h;
            }
        }
        sort(e+1,e+1+n+cnt,cmp);
        //for(int i=n+cnt-10;i<=n+cnt;i++)cout<<e[i].h<<" "<<e[i].sum<<endl;
        e[n+1+cnt].sum=1e18;
        e[n+1+cnt].w=1;
        e[n+1+cnt].h=0;
        long long int now=0,ans=0,last=e[1].h,u=0;
        for(int i=1;i<=n+1+cnt;i++){
            if(now==0)last=e[i].h;
            if(now+e[i].sum<=m){
                now=now+e[i].sum;
                continue;
            }else{
                long long v=m-now;
                if(now==0){
                    if(i==n+1+cnt)continue;
                    ans+=e[i].sum/m*e[i].h;
                    e[i].sum%=m;
                    if(e[i].sum)
                        i--;
                }else{
                    e[i].sum-=v;
                    ans+=last;
                    last=e[i].h;
                    now=0;
                    if(i!=n+1+cnt)
                        i--;
                }
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}
/*
2
4 6
1 1 8
7 2 5
1 1 7
3 2 6
8 1200000
100000 1 100000
100000 1 12345
100000 2 100000
100000 2 12345
100000 1 100000
100000 1 12345
100000 2 100000
100000 2 12345
*/