#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n, k;
    cin >> n >> k;
    vector<tuple<int, int, int, int>> abcd(n);
    rep(i, n) cin >> get<0>(abcd[i]);
    rep(i, n) cin >> get<1>(abcd[i]);
    rep(i, n) cin >> get<2>(abcd[i]);
    rep(i, n) cin >> get<3>(abcd[i]);
    multiset<P> st;
    ll D = 0, U = 0, R = 0;
    for (auto [a, b, c, d] : abcd) {
      st.emplace(a, b);
      R += b;
      U += (ll)a * b;
      st.emplace(c, d);
      int L = -d;
      D -= (ll)c * d;
      while (L < 0) {
        auto [a, b] = *st.begin(); st.erase(st.begin());
        int t = min(b, -L);
        b -= t;
        L += t;
        D += (ll)a * t;
        if (b) st.emplace(a, b);
      }
      while (R > k) {
        auto [a, b] = *st.rbegin(); st.erase(--st.end());
        int t = min<ll>(b, R - k);
        b -= t;
        R -= t;
        U -= (ll)a * t;
        if (b) st.emplace(a, b);
      }
    }
    cout << -D << '\n';
  }
}