#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf=1e18;
const int N=500050;
int n,m,c[N];
ll s[N],dp[N];
struct Range{
    int l,r,p,w;
}a[N];
vector<int> v[N];
multiset<int> S;
inline int lowbit(int x){
    return x&(-x);
}
struct BIT2{
    ll b[N];
    void init(int n,ll o){
        for(int i=1;i<=n;++i){
            b[i]=o;
        }
    }
    inline void Add(int x,ll d){
        while(x<=m){
            b[x]+=d,x+=lowbit(x);
        }
    }
    inline ll Ask(int x){
        ll ans=0;
        while(x){
            ans+=b[x],x-=lowbit(x);
        }
        return ans;
    }
}C,D;
struct BIT1{
    ll b[N];
    void init(int n,ll o){
        for(int i=1;i<=n;++i){
            b[i]=o;
        }
    }
    inline void Add(int x,ll d){
        while(x<=m){
            b[x]=max(b[x],d),x+=lowbit(x);
        }
    }
    inline ll Ask(int x){
        ll ans=-inf;
        while(x){
            ans=max(ans,b[x]),x-=lowbit(x);
        }
        return ans;
    }
}A,B;

void Solve(){
    cin>>n>>m;
    for(int i=1;i<=m+1;++i)v[i].clear();
    for(int i=1;i<=n;++i){
        cin>>a[i].l>>a[i].r>>a[i].w>>a[i].p;
        v[a[i].l].push_back(i);
        v[a[i].r+1].push_back(i);
    }
    S.clear();
    for(int i=1;i<=m;++i){
        for(auto id:v[i]){
            if(a[id].l==i){
                S.insert(a[id].w);
            }
            else{
                S.erase(S.find(a[id].w));
            }
        }
        c[i]=S.empty()?0:*S.rbegin();
    }
    for(int i=1;i<=m;++i){
        s[i]=s[i-1]+c[i];
    }
    ll ans=0;
    sort(a+1,a+n+1,[&](Range x,Range y){
        return x.r==y.r?x.l>y.l:x.r<y.r;
    });
    A.init(m,-inf),B.init(m,-inf),C.init(m,0);
    D.init(m,0);
    ll now=0;
    for(int i=1;i<=n;++i){
        now+=a[i].p;
        ll W=now-C.Ask(a[i].l-1);
        dp[i]=-(s[a[i].r]-s[a[i].l-1]);
        dp[i]=max(dp[i],A.Ask(a[i].l-1)-s[a[i].r]+D.Ask(a[i].l-1));
        dp[i]=max(dp[i],B.Ask(a[i].l-1)-(s[a[i].r]-s[a[i].l-1]));
        dp[i]+=W;
        A.Add(a[i].l,dp[i]+s[a[i].r]-D.Ask(a[i].r));
        B.Add(a[i].r,dp[i]);
        ans=max(ans,dp[i]);
        C.Add(a[i].l,a[i].p);
      //  D.Add(a[i].l,-a[i].p);
        D.Add(a[i].r,a[i].p);
    }
    for(int i=1;i<=n;++i){
        ans-=a[i].p;
    }
    ans+=s[m];
    cout<<ans<<'\n';
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin>>T;
    while(T--)Solve();
    return 0;
}