#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void solve() {
  int n;
  ll k;
  cin >> n >> k;

  vector p(n, pair(0, 0ll));
  for (auto& [f, num] : p) {
    int c, w;
    cin >> c >> w >> f;
    num = c * w;
  }
  sort(p.rbegin(), p.rend());

  ll ans = 0;
  for (int i = 0; i < n; i++) {
    if (p[i].second >= k) {
      ans += p[i].second / k * p[i].first;
      p[i].second %= k;
    }
    if (i == n - 1) {
      if (p[i].second > 0) {
        ans += p[i].first;
      }
      break;
    }
    if (p[i].second == 0)
      continue;
    int j = i;
    ll sum = 0;
    while (j < n and sum <= k) {
      sum += p[j].second;
      j++;
    }
    ans += p[i].first;
    p[j - 1].second = sum - k;
    i = j - 2;
  }

  cout << ans << '\n';
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int tc;
  cin >> tc;
  while (tc--) {
    solve();
  }

  return 0;
}