// 私は猫です

#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=(a);i<=(b);i++)
#define dF(i,a,b) for(int i=(a);i>=(b);i--)
#define wh(lzm) while(lzm--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
using namespace std;
ll read(){
	ll x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return x*f;
}
inline void chkmax(int &x,int y){ x=max(x,y); }
inline void chkmin(int &x,int y){ x=min(x,y); }
const int mod=998244353,maxn=500005;
int cnt,ans,qx[maxn],qy[maxn],a[maxn],li[maxn],ri[maxn],n,m,lim[maxn],ins[maxn];
vector<int>vec[maxn];
int cmh[20],suf[20];
void dfs(int u,int cost){
	if(u==n+1){
		dF(i,cnt,1) suf[i]=suf[i+1]+cmh[i];
		F(i,1,cnt) if(lim[i]<suf[i])return;
		chkmax(ans,cost);
		return;
	}
	++cmh[ri[u]],dfs(u+1,cost+1),--cmh[ri[u]];
	++cmh[li[u]],dfs(u+1,cost),--cmh[li[u]];
	++cmh[1],dfs(u+1,cost-1),--cmh[1];
}
void solve(){
	n=read(),m=read();
	F(i,1,n) a[i]=read(),li[i]=read(),ri[i]=read()+1;
	F(i,1,m) qx[i]=read(),qy[i]=read();
	set<int>s;
	map<int,int>mp;
	s.insert(1),s.insert(inf+5);
	F(i,1,m) s.insert(qx[i]);
	for(auto it=s.begin();it!=s.end();++it) mp[*it]=++cnt;
	F(i,1,n) {
		auto it=s.upper_bound(li[i]);
		if(it!=s.begin()) li[i]=mp[*prev(it)];
		else li[i]=1;
	}
	F(i,1,n) {
		auto it=s.upper_bound(ri[i]);
		ri[i]=mp[*prev(it)];
	}
	F(i,1,cnt) lim[i]=inf;
	F(i,1,m) chkmin(lim[mp[qx[i]]],qy[i]);
	F(i,2,m) chkmin(lim[i],lim[i-1]);
	if(n<=15){
		dfs(1,0);
		printf("%d",ans);
		return;
	}
	F(i,1,n) vec[ri[i]].push_back(li[i]);
	int num=0;
	multiset<int>st;
	dF(i,cnt,1){
		for(int j:vec[i]) st.insert(j),++ans;
		if(i==1)break;
		while(num+(int)st.size()>lim[i]){
			auto it=st.begin();
			ins[*it]++,st.erase(it),--ans;
		}
		num+=ins[i];
		if(num+(int)st.size()>lim[i]) {
			int t=lim[i]-st.size();
			ans-=num-t,num=t;
		}
	}
	printf("%d",ans);
}
signed main(){
	int sjy=1;
	cmh(sjy) solve();
}