#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;

typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef long long ll;

template <typename _T>
inline void read(_T &f) {
    f = 0; _T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}

template <typename T>
void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}

template <typename T>
void print(T x, char t) {
    print(x); putchar(t);
}

const int N = 1e5 + 5;

int c[N], w[N], f[N], id1[N], id2[N];
int T, n, m; ll k;

bool cmp(int i, int j) {
    if (f[i] != f[j]) return f[i] < f[j];
    return i < j;
}

int main() {
    read(T);
    while (T--) {
        read(n); read(k);
        ll ans = 0;
        m = 0;
        for (int i = 1; i <= n; i++) {
            read(c[i]); read(w[i]); read(f[i]);
            id1[i] = i;
            if (w[i] == 1) id2[++m] = i;
        }
        sort(id1 + 1, id1 + n + 1, cmp);
        sort(id2 + 1, id2 + m + 1, cmp);
        ll nowk = 0;
        for (int _ = n; _ >= 1; _--) {
            int i = id1[_];
            if (c[i] * w[i] <= nowk) nowk -= c[i] * w[i];
            else {
                if (nowk % w[i]) {
                    while (m && (!c[id2[m]] || id2[m] == i)) --m;
                    if (m) --c[id2[m]];
                }
                c[i] -= nowk / w[i];
                int cnt = c[i] / (k / w[i]);
                c[i] -= cnt * (k / w[i]);
                ans += 1ll * cnt * f[i];
                nowk = 0;
                if (c[i]) {
                    nowk = k - c[i] * w[i];
                    ans += f[i];
                }
            }
            c[i] = 0;
        }
        print(ans, '\n');
    }
    return 0;
}