#include<bits/stdc++.h>
using namespace std;
int n,m;
#define ll long long
struct no{
	ll x,y;int z;
}e[1001000];
int dx[8]={1,1,0,-1,-1,-1,0,1},dy[8]={0,1,1,1,0,-1,-1,-1}; 
int N;
struct qq{ll x,y;int z;};
vector<qq>P[5];
#define pb push_back
void ad(int x,int y,int t,int z){
	if(t==0)P[t].pb((qq){y,x,z});
	if(t==1)P[t].pb((qq){x,y,z});
	if(t==2)P[t].pb((qq){x+y,-y,z}),P[1].pb((qq){x,y+1,z});
	if(t==3)P[t].pb((qq){x,y-x,z}),P[4].pb((qq){y,x-y+1,z});
}
void fk(int ax,int ay,int bx,int by,int z){
	if(ax>bx||ax==bx&&ay>by)swap(ax,bx),swap(ay,by);
	if(ax==bx)ad(ax,ay,0,z),ad(bx,by+1,0,-z);
	else if(ay==by)ad(ax,ay,1,z),ad(bx+1,by,1,-z);
	else if(ay>by)ad(ax,ay,2,z),ad(bx+1,by-1,2,-z);
	else ad(ax,ay,3,z),ad(bx+1,by+1,3,-z);
}
ll ans[250100];
const int V=500000;
struct BIT{
	ll tr[501000];
	inline void cl(){memset(tr,0,sizeof(tr));}
	inline void ad(ll x,int z){x=max(x,1ll);for(;x<=V;x+=(x&-x))tr[x]+=z;}
	inline ll ask(ll x){ll s=0;for(;x;x-=(x&-x))s+=tr[x];return s;}
}T1,T2;
void solp(vector<qq>Q){
	sort(Q.begin(),Q.end(),[&](qq a,qq b){if(a.x!=b.x)return a.x<b.x;return a.z<b.z;});
	T1.cl(),T2.cl();
	for(qq o:Q){
		if(o.z<2)T1.ad(o.y,o.z),T2.ad(o.y,-o.x*o.z);
		else ans[o.z]+=T1.ask(o.y)*(o.x+1)+T2.ask(o.y);
	}
}
int q;
int main(){
	scanf("%d%d%d",&n,&m,&q);
	for(int i=1;i<=n;i++){
		ll a,b,c,d;
		scanf("%lld%lld%lld%lld",&a,&b,&c,&d);
		e[++N]=(no){a,b,1};
		e[++N]=(no){c+1,d+1,1};
		e[++N]=(no){a,d+1,-1};
		e[++N]=(no){c+1,b,-1};
	}
	for(int i=1;i<=N;i++)fk(e[i].x,e[i].y,e[i].x,e[i].y,e[i].z);
	for(int i=1,u,v,d;i<=m;i++){
		scanf("%d%d%d",&v,&u,&d); 
		for(int j=(u-1)*4+1;j<=u*4;j++)fk(e[j].x+dx[v],e[j].y+dy[v],e[j].x+d*dx[v],e[j].y+d*dy[v],e[j].z),
		e[j].x+=dx[v]*d,e[j].y+=dy[v]*d;
	}
	for(int i=2;i<=q+1;i++){
		ll x,y;scanf("%lld%lld",&x,&y);
		P[0].pb((qq){y,x,i}),P[1].pb((qq){x,y,i});
		P[2].pb((qq){x+y,-y,i}),P[3].pb((qq){x,y-x,i}),
		P[4].pb((qq){y,x-y,i});
	}
	for(int o=2;o<5;o++)for(qq &z:P[o])z.y+=V/2+1;
	for(int i=0;i<5;i++)solp(P[i]);
	for(int i=2;i<=q+1;i++)printf("%lld\n",ans[i]);
	return 0;
}