for(j=1;j<=m-fall[i-1];j++)f[i][j]=min(f[i][j],f[i-1][j+fall[i-1]]);

        for(j=rise[i-1]+1;j<=rise[i-1]+m;j++)f[i][j]=min(f[i-1][j-rise[i-1]]+1,f[i][j-rise[i-1]]+1);

        for(j=1;j<=m-fall[i-1];j++)f[i][j]=min(f[i][j],f[i-1][j+fall[i-1]]);for(j=rise[i-1]+1;j<=rise[i-1]+m;j++)f[i][j]=min(f[i-1][j-rise[i-1]]+1,f[i][j-rise[i-1]]+1);

#include<cstdio>
#include<cstring>
#include<algorithm>
#define infi 0x7fffffff
#define N 10000
#define M 1000
using namespace std;
int n,m,k;
int rise[N+2],fall[N+2];
int f[N+2][M*2+2];
int l[N+2],h[N+2];
bool a[N+2];//a[i]表示横坐标为i的位置是否有管道
template<typename T>inline void r(T& x){char temp=getchar();bool u=0;for(x=0;temp<'0'||temp>'9';u=temp=='-',temp=getchar());for(;temp>='0'&&temp<='9';x=x*10+temp-'0',temp=getchar());if(u)x=-x;return ;
}//快读
int main(){register int i,j,ans=infi;memset(f,127,sizeof f);memset(a,0,sizeof a);r(n),r(m),r(k);for(i=1;i<=n;i++)l[i]=0,h[i]=m+1;{register int p;for(i=0;i<n;i++)r(rise[i]),r(fall[i]);for(i=1;i<=k;i++)r(p),r(l[p]),r(h[p]),a[p]=1;}for(i=1;i<=m;i++)f[0][i]=0;for(i=1;i<=n;i++){for(j=rise[i-1]+1;j<=rise[i-1]+m;j++)//跳跃f[i][j]=min(f[i-1][j-rise[i-1]]+1,f[i][j-rise[i-1]]+1);
//j<=rise[i-1]+m：再往上跳没有意义for(j=m+1;j<=rise[i-1]+m;j++)     //顶端特殊处理f[i][m]=min(f[i][m],f[i][j]);for(j=1;j<=m-fall[i-1];j++)         //下滑f[i][j]=min(f[i][j],f[i-1][j+fall[i-1]]);for(j=1;j<=l[i];j++)               //管道赋值为极大值f[i][j]=2e9;for(j=h[i];j<=m;j++)f[i][j]=2e9;}for(i=1;i<=m;i++)ans=min(ans,f[n][i]);if(ans<2e9)printf("1\n%d\n",ans);else{register int flag=0;for(i=n-1;i>=1&&!flag;i--)for(j=1;j<=m&&!flag;j++)if(f[i][j]<2e9){flag=0;flag=i;}ans=0;for(i=1;i<=flag;i++)if(a[i])ans++;printf("0\n%d\n",ans);}return 0;
}
//码丑勿喷^-^