#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll find_min(vector<pair<ll,ll>>v, ll l, ll r) {
    priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>>pq;
    while(l<=r) {
        pq.push({v[l].first, v[l].second});
        l++;
    }
//    return pq.top();
    return pq.top().second;
}
void solve(){
    ll n,m;
    cin>>n>>m;
    vector<pair<ll,ll>>v(n+1);
        for(ll i=1;i<=n;i++) {
            ll x;
            cin>>x;

            v[i] = {x, i};
             }
    while(m--){
        ll r,w;
        cin>>r>>w;
        auto idx=find_min(v,1,r);//当前区间最小
        v[idx].first-=w;
    }
    sort(v.begin()+1,v.end(),[](const auto &a,const auto &b){
        return a.first<b.first;
    });
    ll res=0;
    for (ll i = 1; i <= n; ++i) {
        res+=v[i].first;
        cout<<res<<' ';
    }
    cout<<endl;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin.tie(0);
    ll t;
    cin>>t;
    while(t--)solve();
    return 0;
}