#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=5e5+5,M=N*4+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m;ll A[N];
pii B[N];
void Solve(){
	int i,j;scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++) scanf("%lld",&A[i]);
	for(i=1;i<=m;i++) scanf("%d%d",&B[i].fi,&B[i].se);
	sort(B+1,B+m+1);
	int R=1,Id=1;
	for(i=1;i<=n;i++){
		while(R<=B[i].fi) {
			if(A[Id]>A[R]) Id=R;R++;
		}
		A[Id]-=B[i].se;
	}
	sort(A+1,A+n+1);
	for(i=1;i<=n;i++) A[i]+=A[i-1],printf("%lld ",A[i]);printf("\n");
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}