#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cmath>

 #include<iostream>

 using namespace std;

 const int maxn=;

 int n,m,k;

 int a[maxn][]={};

 int f[maxn][]={},g[]={};

 int d[maxn]={};

 struct nod{

     int p,l,h;

 }e[maxn];

 bool mmp(nod aa,nod bb){

     return aa.p<bb.p;

 }

 int main(){

     //freopen("wtf.in","r",stdin);

     scanf("%d%d%d",&n,&m,&k);

     for(int i=;i<=n;i++){

         scanf("%d%d",&a[i][],&a[i][]);

     }

     for(int i=;i<=k;i++){

         scanf("%d%d%d",&e[i].p,&e[i].l,&e[i].h);

     }sort(e+,e++k,mmp);

     for(int i=;i<=k;i++){

         d[e[i].p]=i;

     }

     memset(f,,sizeof(f));

     int ans=f[][],cnt=f[][];

     for(int i=;i<=m;i++)f[][i]=;

     int w=;

     for(int i=;i<n;i++){

         int mi=,ma=m;

         if(d[i]){

             mi=e[d[i]].l+,ma=e[d[i]].h-;

         }

         int ff=;

         memset(g,,sizeof(g));

         for(int j=mi;j<=ma;j++){

             g[j]=f[i][j];

             if(f[i][j]!=cnt)ff=;

         }

         for(int j=;j<=m;j++){

             int x=min(m,a[i+][]+j);

             g[x]=min(g[x],g[j]+);

         }

         for(int j=;j<=m;j++){

             int x=min(m,a[i+][]+j);

             f[i+][x]=min(f[i+][x],g[j]+);

         }

         for(int j=mi;j<=ma;j++){

             if(j-a[i+][]>) f[i+][j-a[i+][]]=min(f[i+][j-a[i+][]],f[i][j]);

         }

         if(!ff){

             printf("0\n%d\n",w);

             return ;

         }

         if(d[i])w++;

     }

     for(int i=;i<=m;i++){

         ans=min(ans,f[n][i]);

     }

     printf("1\n%d\n",ans);

     return ;

 }