#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<string.h>
#include <string>
#include<math.h>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<map>
#include<queue>
#include<stack>
#include<functional>
using namespace std;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define inf 1e18
const int N = 1e5+7;
const int M = 205;
const int mod = 1e9 + 7;
char* p1, * p2, buf[100000];
#define nc() (p1==p2 && (p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++)
int read()
{
	int x = 0, f = 1;
	char ch = nc();
	while (ch < 48 || ch>57)
	{
		if (ch == '-')
			f = -1;
		ch = nc();
	}
	while (ch >= 48 && ch <= 57)
		x = x * 10 + ch - 48, ch = nc();
	return x * f;
}
struct node
{
	int c;
	int w;
	int f;
};
void solve()
{
	int n, k;
	n = read();
	k = read();
	int mx = -inf;
	vector<node>x;
	vector<int>q;
	for (int i = 1; i <= n; i++)
	{
		int c, w, f;
		c = read();
		w = read();
		f = read();
		x.push_back({ c,w,f });
		q.push_back(f);
		mx = max(mx, f);
	}
	sort(q.begin(), q.end(),greater<int>());
	q.resize(unique(q.begin(), q.end()) - q.begin());

	vector<vector<int>>a(3, vector<int>(mx+1, 0));//重量为i，高度为h的数量
	for (int i = 0; i < n; i++)
	{
		int c, w, f;
		c = x[i].c, w = x[i].w, f = x[i].f;
		a[w][f] += c;
	}
	int sum = 0;
	int re = 0;
	for (auto i:q)//从最高层往下枚举
	{
		if (re)//前面电梯带走他
		{
			if (((int)re / 2) > a[2][i])//空电梯把他带走
			{
				re -= a[2][i] * 2;
				a[2][i] = 0;
			}
			else//带不完
			{
				a[2][i] -= re / 2;
				re %= 2;
			}
			if (re)//还有剩余
			{
				if (((int)re / 2) > a[1][i])//空电梯把他带走
				{
					re -= a[1][i];
					a[1][i] = 0;
				}
				else//带不完
				{
					a[1][i] -= re;
					re = 0;
				}
			}
		}
		int cnt = (a[2][i] * 2 + a[1][i]) / k;
		sum += cnt * i;
		if ((a[2][i] * 2 + a[1][i]) % k)
		{
			re += k - ((a[2][i] * 2 + a[1][i]) % k);
			sum += i;
		}
	}
	printf("%lld\n", sum);
}

signed main()
{
	int T = 1;
	cin >> T;
	while (T--)
	{
		solve();
	}
	return 0;
}