#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
int dp[2][1005],n,m,k,inf,num=0,f=0;
struct node{
	int u,d,f;
}gd[10005];
struct edge{
	int x,y;
}d[10005];
int main(){
	scanf("%d%d%d",&n,&m,&k);
	for(int i=0;i<n;i++) scanf("%d%d",&d[i].x,&d[i].y);
	for(int i=1;i<=n;i++) gd[i].d=0,gd[i].u=m+1;
	for(int i=1;i<=k;i++){
		int p;scanf("%d",&p);
		scanf("%d%d",&gd[p].d,&gd[p].u);
		gd[p].f=1;
	}
	inf=1e8;
	for(int i=0;i<n;i++){
		int x=d[i].x,y=d[i].y;
		int u,d;
		u=gd[i+1].u;
		d=gd[i+1].d;
		for(int j=1;j<=m;j++) dp[(i+1)%2][j]=inf;
		for(int j=x+1;j<=m+x;j++) dp[(i+1)%2][j]=min(dp[(i+1)%2][j-x],dp[i%2][j-x])+1;
		for(int j=m+1;j<=m+x;j++) dp[(i+1)%2][m]=min(dp[(i+1)%2][j],dp[(i+1)%2][m]);
		for(int j=1;j<=m-y;j++) dp[(i+1)%2][j]=min(dp[(i+1)%2][j],dp[i%2][j+y]);
		for(int j=1;j<=d;j++) dp[(i+1)%2][j]=inf;
		for(int j=u;j<=m;j++) dp[(i+1)%2][j]=inf;
		/*cout<<d<<' '<<u<<' '<<x<<' '<<y<<endl;
		for(int j=1;j<=m;j++) cout<<dp[(i+1)%2][j]<<' ';
		cout<<endl<<endl<<endl<<endl;*/
		f=0;
		for(int j=1;j<=m;j++) if(dp[(i+1)%2][j]<inf) f=1;
		if(f==0) break;
		if(gd[i+1].f==1) num++;
	}
	if(f==0){
		cout<<0<<endl<<num;
		return 0;
	}
	cout<<1<<endl;
	int ans=1e9;
	for(int i=1;i<=m;i++) ans=min(ans,dp[n%2][i]);
	cout<<ans;
	return 0;
}