RT，顺便问下能不能卡掉。

//2022tysc0819
#include<bits/stdc++.h>
//#include<bits/extc++.h>
using namespace std;
//using namespace __gnu_pbds;
//#define int long long
//#define double long double
//#define map unordered_map
//#pragma G++ optimize(2,3,"Ofast","inline")
const int N=3e5+10,M=1010,P=1e9+7,MOD=998244353,INF=1e9;
const double PI=3.1415926,EPS=0.00001;
struct line{
	int l,r,k;
}a[N];
int n,m,t[N],cnt,tr[2*N],ans;
bool ist[N];
bool cmp(line x,line y){
	if(x.l!=y.l)return x.l<y.l;
	return x.r<y.r;
}
int lb(int x){return x&-x;}
void upd(int x,int v){while(x<=3e5+1){tr[x]+=v;x+=lb(x);}}
int qry(int x){int su=0;while(x>=1){su+=tr[x];x-=lb(x);}return su;}
map<int,int>mp;
void solve(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n>>m;
	mp.clear();
	for(int i=1;i<=n;i++){
		cin>>t[i];
		mp[t[i]]=1;
	}
    for(int i=1;i<=m;i++){
		cin>>a[i].l>>a[i].r>>a[i].k;
		mp[a[i].l]=1;
		mp[a[i].r]=1;
	}
	memset(ist,0,sizeof(ist));
	cnt=0;
	for(auto&v:mp)v.second=++cnt;
	for(int i=1;i<=n;i++){
		t[i]=mp[t[i]];
		ist[t[i]]=1;
	}
	for(int i=1;i<=m;i++){
		a[i].l=mp[a[i].l];
		a[i].r=mp[a[i].r];
	}
    sort(t+1,t+n+1);
	sort(a+1,a+m+1,cmp);
	ans=0;
	memset(tr,0,sizeof(tr));
	for(int i=m;i>=1;i--){
		if(qry(a[i].r)-qry(a[i].l-1)>=a[i].k)continue;
		else{
			for(int j=a[i].l;j<=a[i].r;j++)if(ist[j]){
				upd(j,1);ans++;ist[j]=0;
				if(qry(a[i].r)-qry(a[i].l-1)>=a[i].k)break;
			}
		}
	}
	cout<<n-ans<<"\n";
    return;
}
signed main(){
	int _;cin>>_;
	while(_--)solve();
	return 0;
}
//note: