#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
#define eb emplace_back
#define MP make_pair
#define MT make_tuple
#define IT iterator
#define fi first
#define se second
#define For(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define Rep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define CLR(a, v) memset(a, v, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(a))
#define debug cerr << "ztxakking\n"
#define y0 ztxaknoi
#define y1 ztxakioi
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using vi = vector<int>;
template<typename T>
using V = vector<T>;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
int n;
ll k, sum;
V<pil> v[2];
void slv() {
  cin >> n >> k;
  For(i, 0, 1) v[i].clear();
  For(i, 1, n) {
    int c, w, f; cin >> c >> w >> f, --w;
    v[w].eb(f, c);
  }
  sort(all(v[0]), greater<pil>());
  ll left = -1;
  for (auto [y, x] : v[0]) {
    if (x % 2 == 0) {
      if (left != -1) v[1].eb(left, 1), v[1].eb(y, x / 2 - 1), left = y;
      else v[1].eb(y, x / 2);
    } else {
      if (left != -1) v[1].eb(left, 1), v[1].eb(y, x / 2), left = -1;
      else v[1].eb(y, x / 2), left = y;
    }
  }
  if (~left) v[1].eb(left, 1);
  sort(all(v[1]), greater<pil>());
  sum = left = 0;
  for (auto [x, y] : v[1]) {
    if (y <= left) {
      left -= y;
      continue;
    }
    y -= left;
    if (y % (k / 2)) {
      sum += (y / (k / 2) + 1) * x;
      left = k / 2 - y % (k / 2);
    } else {
      sum += y / (k / 2) * x;
      left = 0;
    }
  }
  cout << sum << '\n';
}
int main() {
  // freopen("code.in", "r", stdin) && freopen("code.out", "w", stdout);
  ios::sync_with_stdio(0), cin.tie(0);
  int t; cin >> t;
  while (t--) slv();
  return 0;
}