#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(i,j,k) for(int i=j;i<=k;++i)
#define g(i,j,k) for(int i=j;i>=k;--i)
int n,m,s,l;
inline int read(){
	int x=0,f=1;char ch=getchar();
	for(;'0'>ch||ch>'9';ch=getchar())if(ch=='-')f=-1;
	for(;'0'<=ch&&ch<='9';ch=getchar())x=(x<<3)+(x<<1)+(ch^48);
	return x*f;
}
const int N=6e5,inf=1e17;
struct Kazemaru{
	struct xds{int l,r,c,t;}a[N<<2];
	#define mid (a[id].l+a[id].r)/2
	inline void Put(int id,int c){a[id].c=max(a[id].c,c);}
	inline void Add(int id,int c){a[id].c+=c;a[id].t+=c;}
	void bt(int id,int l,int r){a[id]={l,r,-inf};if(l<r)bt(id*2,l,mid),bt(id*2+1,mid+1,r);}
	void put(int id,int l,int r,int c){
		if(r<a[id].l||a[id].r<l)return;
		if(l<=a[id].l&&a[id].r<=r)return Put(id,c);
		put(id*2,l,r,c);put(id*2+1,l,r,c);
	}
	void add(int id,int l,int r,int c){
		if(r<a[id].l||a[id].r<l)return;
		if(l<=a[id].l&&a[id].r<=r)return Add(id,c);
		add(id*2,l,r,c);add(id*2+1,l,r,c);
		a[id].c=max(a[id*2].c,a[id*2+1].c)+a[id].t;
	}
	void got(int id,int*b,int w){
		w=max(w,a[id].c);
		if(a[id].l<a[id].r)got(id*2,b,w),got(id*2+1,b,w);
		else b[a[id].l]=w;
	}
	int ask(int id,int l,int r){
		if(r<a[id].l||a[id].r<l)return-inf;
		if(l<=a[id].l&&a[id].r<=r)return a[id].c;
		return max(ask(id*2,l,r),ask(id*2+1,l,r));
	}
}T;
struct op{int x,y,z;};
vector<op>q[N];int a[N];
#define op(x,y)T.add(1,x,x,y+inf);
inline void doing(){
	m=read();n=read()+1;
	f(_,1,m){
		int l=read(),r=read(),w=read(),p=read();
		q[l].push_back({l,w,-p});
		q[r+1].push_back({l,w,p});
	}
	T.bt(1,1,n);
	f(i,1,n)for(op e:q[i])T.put(1,e.x,i-1,e.y);
	T.got(1,a,0);T.bt(1,0,n);T.add(1,0,0,inf);
	f(i,1,n){
		for(op e:q[i])T.add(1,0,e.x-1,e.z);
		T.add(1,i,i,T.a[1].c+a[i]+inf);
		// f(i,0,n)cout<<((s=T.ask(1,i,i))>=-inf/2?s:-99)<<" ";cout<<endl;
	}
	f(i,1,n)q[i]={};
	cout<<T.a[1].c<<"\n";
	// f(i,1,n)cout<<a[i]<<" ";cout<<endl;
}
signed main(){
	int t=read();
	while(t--)doing();
	return 0;
}