#include <bits/stdc++.h>
using namespace std;
long long int nex[100005];
struct node{
    long long int sum,w,h;
}e[100006];
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;
        cin>>n>>m;
        for(int i=1;i<=n;i++)cin>>e[i].sum>>e[i].w>>e[i].h;
        sort(e+1,e+1+n,cmp);
        e[n+1].sum=1e18;
        e[n+1].w=1;
        e[n+1].h=0;
        for(int i=n+1;i>=1;i--){
            if(e[i].w&1)nex[i]=i;
            else nex[i]=nex[i+1];
        }
        long long int now=0,ans=0,last=e[1].h,u=0;
        for(int i=1;i<=n+1;i++){
            if(e[i].sum==0)continue;
            if(u&&e[i].w%2)
                if(u>=e[i].sum){
                    u-=e[i].sum;
                    continue;
                }
                else 
                    e[i].sum-=u;
            if(now==0)last=e[i].h;
            if(now+e[i].sum*e[i].w<m){
                now=now+e[i].sum*e[i].w;
                continue;
            }else{
                long long v=m-now;
                if(now==0){
                    if(i==n+1)continue;
                    if(e[i].w&1){
                        ans+=e[i].sum/m*e[i].h;
                        e[i].sum%=m;
                        i--;
                    }else{
                        if(m%2==0){
                            ans+=e[i].sum/(m/2)*e[i].h;
                            e[i].sum%=(m/2);
                            i--;
                        }else{
                            ans+=e[i].sum/(m/2)*e[i].h;
                            e[i].sum%=(m/2);
                            u+=e[i].sum/(m/2);
                            i--;
                        }
                    }
                }else
                if(e[i].w==2&&v%2==1){
                    v--;
                    e[i].sum-=v/2;
                    ans+=last;
                    last=e[i].h;
                    now=0;
                    u++;
                    i--;
                }else{
                    e[i].sum-=v/e[i].w;
                    ans+=last;
                    last=e[i].h;
                    now=0;
                    if(i!=n+1)
                        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
*/