利用两个线段树更新即可
虽然不是正解 速度有待加强，不过练练线段树也不错
//
// GGGGGGGGGGGGG CCCCCCCCCCCCC AAA
// GGG::::::::::::G CCC::::::::::::C A:::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::::A
// G:::::G GGGGGG C:::::C CCCCCC A:::::::::A
//G:::::G C:::::C A:::::A:::::A
//G:::::G C:::::C A:::::A A:::::A
//G:::::G GGGGGGGGGGC:::::C A:::::A A:::::A
//G:::::G G::::::::GC:::::C A:::::A A:::::A
//G:::::G GGGGG::::GC:::::C A:::::AAAAAAAAA:::::A
//G:::::G G::::GC:::::C A:::::::::::::::::::::A
// G:::::G G::::G C:::::C CCCCCC A:::::AAAAAAAAAAAAA:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::A A:::::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A A:::::A
// GGG::::::GGG:::G CCC::::::::::::C A:::::A A:::::A
// GGGGGG GGGG CCCCCCCCCCCCCAAAAAAA AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define VAR(a,b) decltype(b) a=(b)
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)
#define gettime() end_time=clock();printf("now running time is %.7f\\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);
#else
#define VAR(a,b) __typeof(b) a=(b)
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
typedef unsigned long long int UInt;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 100005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define eps 1e-6
#define X first
#define Y second
clock_t start_time=clock(), end_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
#define lson(x) (x<<1)
#define rson(x) (x<<1|1)
struct tree{
Int v[M*4];
int mode;
tree(){
Set(v,0);
mode=0;
}
void init(){
Set(v,0);
mode=0;
}
void push_down(int index){
v[lson(index)]+=v[index];
v[rson(index)]+=v[index];
v[index]=0;
}
void update(int index,int l,int r,int bl,int br,Int add){
if(l<=bl&&br<=r){
v[index]+=add;
return ;
}
push_down(index);
int mid=(br+bl)>>1;
if(r<=mid){
update(lson(index),l,r,bl,mid,add);
}else if(l>mid){
update(rson(index),l,r,mid+1,br,add);
}else{
update(lson(index),l,mid,bl,mid,add);
update(rson(index),mid+1,r,mid+1,br,add);
}
}
void query(int index,int bl,int br,Int a[]){
if(bl==br){
if(mode){
a[bl]=a[bl]*v[index];
}else a[bl]+=v[index];
return;
}
push_down(index);
int mid=(bl+br)>>1;
query(lson(index),bl,mid,a);
query(rson(index),mid+1,br,a);
}
};
int n,m,k;
int l[M],r[M];
Int d[M];
Int a[M];
tree instree,anstree;
int main() {
ios_base::sync_with_stdio(0);
while(~scanf("%d%d%d",&n,&m,&k)){
instree.init();
anstree.init();
for(int i=1;i<=n;i++)scanf("%I64d",&a[i]);
for(int i=1;i<=m;i++){
scanf("%d%d%I64d",&l[i],&r[i],&d[i]);
// instree.update(1,i,i,1,m,1);
}
for(int i=0;i<k;i++){
int x,y;
scanf("%d%d",&x,&y);
instree.update(1,x,y,1,m,1);
}
instree.mode=1;
instree.query(1,1,m,d);
for(int i=1;i<=m;i++){
// debug("%I64d\\n",d[i]);
anstree.update(1,l[i],r[i],1,n,d[i]);
}
anstree.query(1,1,n,a);
for(int i=1;i<=n;i++)printf("%I64d ",a[i]);
Pln();
}
}