#include<bits/stdc++.h>
using namespace std;
int n,m,k,x[10010],y[10010],h[10010],p,l[10010],f[10010][2010],check[10010],cnt=0; 
bool flag;
int main(){
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++){
		cin>>x[i]>>y[i];
		h[i]=m+1;
	}
	for(int i=1;i<=k;i++){
		cin>>p;
		cin>>l[p]>>h[p];
		check[p]=1;
	}
	memset(f,0x3f,sizeof(f));
	for(int i=1;i<=m;i++){
		f[0][i]=0;
	}
	for(int i=1;i<=n;i++){
		for(int j=x[i]+1;j<=x[i]+m;j++){
			f[i][j]=min(f[i-1][j-x[i]]+1,f[i][j-x[i]]+1);
		}
		for(int j=m+1;j<=x[i]+m;j++){
			f[i][m]=min(f[i][m],f[i][j]);
		}
		for(int j=1;j<=m-y[i];j++){
			f[i][j]=min(f[i][j],f[i-1][j+y[i]]);
		}
		if(!check[i])continue;
		for(int j=0;j<=l[i];j++){
			f[i][j]=0x3f3f3f3f;
		} 
		for(int j=h[i]+1;j<=m;j++){
			f[i][j]=0x3f3f3f3f;
		}
		flag=false;
		for(int j=l[i]+1;j<h[i];j++){
			if(f[i][j]<0x3f3f3f3f){
				flag=true;
				break;
			}
		}
		if(!flag){
			cout<<0<<"\n"<<cnt;
			return 0;
		} 
		cnt++;
	}
	int ans=0x3f3f3f3f;
	for(int i=1;i<=m;i++){
		ans=min(ans,f[n][i]);
	}
	cout<<1<<"\n"<<ans;
	return 0;
}