#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N;
Int K;

struct CWF {
  Int c, w, f;
};
vector<CWF> A;

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%lld", &N, &K);
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld%lld%lld", &A[i].c, &A[i].w, &A[i].f);
    }
    sort(A.begin(), A.end(), [&](const CWF &a0, const CWF &a1) -> bool {
      return (a0.f > a1.f);
    });
    
    Int ans = 0;
    Int capa = 0;
    Int num1 = 0;
    for (int i = 0; i < N; ++i) {
      Int c = A[i].c;
      if (A[i].w == 1) {
        const Int t = min(c, num1);
        c -= t;
        num1 -= t;
      }
      {
        const Int t = min(c, capa / A[i].w);
        c -= t;
        capa -= t * A[i].w;
      }
      if (c) {
        if (capa == 1) {
          num1 += 1;
        }
        const Int each = K / A[i].w;
        const Int quo = c / each;
        const Int rem = c % each;
        ans += (quo + (rem ? 1 : 0)) * A[i].f;
        capa = K - rem * A[i].w;
      }
    }
    printf("%lld\n", ans);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}