#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int mp[N][1010],dp[N][1010],x[N],y[N],s[N],n,m,k;
int main(){
    cin >> n >> m >> k;
    for(int i=1;i<=n;i++) cin >> x[i] >> y[i];
    for(int i=1;i<=k;i++){
        int p,l,h;
        cin >> p >> l >> h;
        for(int j=1;j<=l;j++) mp[p][j]=1;
        for(int j=m;j>=h;j--) mp[p][j]=1;
        s[p]++;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++) dp[i][j]=999999999;
    }
    for(int i=1;i<=n;i++){
        for(int j=x[i]+1;j<=m+x[i];j++) dp[i][j]=min(dp[i-1][j-x[i]]+1,dp[i][j-x[i]]+1);
        for(int j=m+1;j<=m+x[i];j++){
			if(!mp[i][j]) dp[i][m]=min(dp[i][m],dp[i][j]);
		}
        for(int j=1;j<=m-y[i];j++){
			if(!mp[i][j]) dp[i][j]=min(dp[i][j],dp[i-1][j+y[i]]);
		}
        for(int j=1;j<=m;j++){
			if(mp[i][j]) dp[i][j]=999999999;
		}
    }
    int minn=999999999;
    int cnt=0;
    for(int i=1;i<=n;i++){
        bool flag=0;
        for(int j=1;j<=m;j++) if(dp[i][j]<10000001) flag=1;
        if(flag==0){
            cout << 0 << endl;
            cout << cnt << endl;
            return 0;
        }
        cnt+=s[i];
    }
    cout << 1 << endl;
    for(int j=1;j<=m;j++){
        if(dp[n][j]<=minn) minn=dp[n][j];
    }
    cout << minn;
    return 0;
}