#include <iostream>
using namespace std;
#include <set>
#include <algorithm>
#include <cmath>
#include <map>
#include <cstdio>
#include <string>
#include <cstring>
#include <string.h>
#include <stdlib.h>
#include <iomanip>
#include <fstream>
#include <stdio.h>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <random>
#include <list>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define lowbit(x) ((x) & (-x))
ll extend_gcd(ll a, ll b, ll &x, ll &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    ll d = extend_gcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
}
ll fastpow(ll a, ll n, ll mod)
{
    ll ans = 1;
    a %= mod;
    while (n)
    {
        if (n & 1)
            ans = (ans * a) % mod; //% mod
        a = (a * a) % mod;         //% mod
        n >>= 1;
    }
    return ans;
}

inline void write(__int128 x)
{
    if (x > 9)
    {
        write(x / 10);
    }
    putchar(x % 10 + '0');
}
__int128 sqrt(__int128 m)
{
    __int128 leftt = 0, rightt = ((__int128)1) << 51, ret = -1, mid;
    while (leftt < rightt)
    {
        mid = (leftt + rightt) / 2;
        if (mid * mid > m)
        {
            rightt = mid;
        }
        else
        {
            leftt = mid + 1;
            ret = mid;
        }
    }
    return ret;
}

const double eps = 1e-6;
int sgn(double x)
{
    if (fabs(x) < eps)
    {
        return 0;
    }
    else
        return x < 0 ? -1 : 1;
}

struct Point
{
    double x, y;
    Point()
    {
    }
    Point(double x, double y) : x(x), y(y)
    {
    }
    Point operator+(Point B)
    {
        return Point(x + B.x, y + B.y);
    }
    Point operator-(Point B)
    {
        return Point(x - B.x, y - B.y);
    }
    bool operator==(Point B)
    {
        return sgn(x - B.x) == 0 && sgn(y - B.y) == 0;
    }
    bool operator<(Point B)
    {
        return sgn(x - B.x) < 0 || (sgn(x - B.x) == 0 && sgn(y - B.y) < 0);
    }
};
typedef Point Vector;
double Cross(Vector A, Vector B) // 叉积
{
    return A.x * B.y - A.y * B.x;
}
double Distance(Point A, Point B)
{
    return hypot(A.x - B.x, A.y - B.y);
}
int Convex_hull(Point *p, int n, Point *ch)
{
    n = unique(p, p + n) - p;
    sort(p, p + n);
    int v = 0;

    for (int i = 0; i < n; i++)
    {
        while (v > 1 && sgn(Cross(ch[v - 1] - ch[v - 2], p[i] - ch[v - 1])) <= 0)
        {
            v--;
        }
        ch[v++] = p[i];
    }

    int j = v;

    for (int i = n - 2; i >= 0; i--)
    {
        while (v > j && sgn(Cross(ch[v - 1] - ch[v - 2], p[i] - ch[v - 1])) <= 0)
        {
            v--;
        }
        ch[v++] = p[i];
    }
    if (n > 1)
    {
        v--;
    }
    return v;
}

int kmp(string s, string p)
{
    int ans = 0, lastt = -1;
    int lenp = p.size();
    vector<int> Next(lenp + 3, 0);
    rep(i, 1, lenp - 1)
    {
        int j = Next[i];
        while (j && p[j] != p[i])
        {
            j = Next[j];
        }
        if (p[j] == p[i])
        {
            Next[i + 1] = j + 1;
        }
        else
        {
            Next[i + 1] = 0;
        }
    }
    int lens = s.size();
    int j = 0;
    rep(i, 0, lens - 1)
    {
        while (j && s[i] != p[j])
        {
            j = Next[j];
        }
        if (s[i] == p[j])
        {
            j++;
        }
        if (j == lenp)
        {
            ans++;
        }
    }
    return ans;
}

int dir[4][2] =
    {
        {-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // 左右上下
// int dir[8][2]={
//         {-1, 0}, {0, 1}, {1, 0}, {0, -1},{-1,-1},{-1,1},{1,-1},{1,1}
// };

#define endl '\n' // 交互题请删除本行
const ll inf = 1000000000000000000ll;
const ll mod1 = 998244353ll, P1 = 131, mod2 = 1e9 + 7ll, P2 = 13331;
ll inverse(ll x)
{
    return fastpow(x, mod1 - 2, mod1);
}

const int N = 1e6 + 10, M = 1e6 + 10;

///////////////////////////////////

int tt;

int n;

ll k;

map<pll, ll> ma;

struct node
{
    ll zhi;
    ll shuliang;
    ll lou;
} st[N];
int cnt;

ll ans;

///////////////////////////////////

bool cmp(node x, node y)
{
    if (x.lou != y.lou)
    {
        return x.lou > y.lou;
    }
    return x.zhi > y.zhi;
}

///////////////////////////////////

void init()
{
    ma.clear();
    cnt = 0;
    ans = 0;
}

///////////////////////////////////

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0); // 交互题请删除本行
   // freopen("ain.txt", "r", stdin);
   // freopen("aout.txt", "w", stdout);

    cin >> tt;
    while (tt--)
    {
        cin >> n >> k;
        init();

        rep(i, 1, n)
        {
            ll num, w, dest;
            cin >> num >> w >> dest;
            ma[{dest, w}] += num;
        }

        for (auto i : ma)
        {
            cnt++;
            st[cnt].lou = i.first.first;
            st[cnt].zhi = i.first.second;
            st[cnt].shuliang = i.second;
        }

        sort(st + 1, st + cnt + 1, cmp);

        bool flag = 0;
        ll shengyu = 0;
        rep(i, 1, cnt)
        {
            if (st[i].zhi == 1) // easy
            {
                if (flag)
                {
                    flag = 0;
                    st[i].shuliang--;
                }

                if (st[i].shuliang <= shengyu)
                {
                    shengyu -= st[i].shuliang;
                    continue; // meishi le
                }

                st[i].shuliang -= shengyu;

                ans += ((st[i].shuliang - 1) / k + 1) * st[i].lou;
                st[i].shuliang %= k;
                if (st[i].shuliang)
                {
                    shengyu = k - st[i].shuliang;
                }
                else
                {
                    shengyu = 0;
                }
            }
            else
            {
                if (shengyu % 2 == 1)
                {
                    shengyu--;
                    flag = 1;
                }

                if (shengyu >= st[i].shuliang * 2)
                {
                    shengyu -= st[i].shuliang * 2;
                    continue;
                }
                st[i].shuliang -= shengyu / 2;
                shengyu = 0;
                ans += st[i].lou * ((st[i].shuliang * 2 - 1) / k + 1);
                //
                // cout<<st[i].lou<<" "<<st[i].shuliang<<" ";
                st[i].shuliang %= k / 2;
                if (st[i].shuliang)
                {
                    shengyu = k - 2 * st[i].shuliang;
                }
            }
            //
         //   cout << ans << endl;
        }
        cout << ans << endl;
    }

    return 0;
}