//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
ll a[200200];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		int n,m;
		cin>>n>>m;
		for(int i=1;i<=n;i++)
			cin>>a[i];
		vector<pii> vec;
		while(m--)
		{
			int x,y;
			cin>>x>>y;
			vec.pb(x,y);
		}
		srt(vec);
		int p=1,p2=1;
		for(auto pr:vec)
		{
			int r=pr.first;
			ll w=pr.second;
			while(p<r)
			{
				p++;
				if(a[p]<a[p2])
					p2=p;
			}
			a[p2]-=w;
		}
		sort(a+1,a+n+1);
		ll sum=0;
		for(int i=1;i<=n;i++)
		{
			sum+=a[i];
			cout<<sum<<' ';
		}
		cout<<'\n';
	}
	return 0;
}