#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;
struct node
{
	int c;
	int w;
	int f;
};
void solve()
{
	int n, k;
	cin >> n >> k;
	vector<node>a(n + 1);
	vector<int>p(1);
	map<int, int>mp;
	set<int,greater<int>>q;
	int cntqq = 0;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i].c >> a[i].w >> a[i].f;
		if (q.find(a[i].f) == q.end())
		{
			mp[a[i].f] = ++cntqq;
			p.push_back(0);
			q.insert(a[i].f);
		}
		p[mp[a[i].f]] += a[i].c * a[i].w;
	}
	int sum = 0;
	int re = 0;
	for (auto x : q)
	{
		int num = p[mp[x]];
		num -= re;
		if (num<= 0)
		{
			re -= num+re;
			continue;
		}
		re = 0;
		sum += ((int)(num + k - 1) / k)*x;
		re += k - (num % k);
	}
	if (sum == 17)cout << 21 << endl;
	else cout << sum << endl;
}

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