// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) {rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1];}

const int N = 1e5;
int T, a, b, s[N + 5][2];
vi q;

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	for(cin >> T; T--; ) {
		cin >> a >> b;
		int x, y, z;
		q.clear();
		rep(i, 1, a) {
			cin >> x >> y >> z;
			q.PB(z);
			s[z][y - 1] += x;
		}
		sort(q.begin(), q.end(), greater<int>());
		q.erase(unique(q.begin(), q.end()), q.end());
		int lst = 0, ans = 0;
		for(int x : q) {
			int y = s[x][0], z = s[x][1];
			if((lst & 1) && y) --lst, --y;
			int mn = min(z, lst / 2);
			lst -= mn * 2, z -= mn;
			mn = min(y, lst);
			lst -= mn, y -= mn;
			ans += (z * 2 + y + b - 1) / b * x;
			lst += (b - (z * 2 + y) % b + b) % b;
		}
		cout << ans << '\n';
		for(int x : q) s[x][0] = s[x][1] = 0;
	}
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}