#include<bits/stdc++.h>

using namespace std;

#define int long long
using i64 = long long;
using i32 = int32_t;
using vi = vector<i64>;
using pii = pair<i64, i64>;

void solve() {
    int n, m;
    cin >> n >> m;
    vi a(n);
    for (auto &i: a) cin >> i;
    vector<pii> b(m);
    for (auto &[r, w]: b)
        cin >> r >> w;
    sort(b.begin(), b.end());
    i64 res = LLONG_MAX, used = -1;
    for (int t = m - 1, sufMin = LLONG_MAX, cnt = 0, i = n; i >= 1; i--) {
        sufMin = min(sufMin, a[i - 1]);
        while (t >= 0 and b[t].first >= i)
            cnt += b[t].second, t--;
        if (sufMin - cnt < res) {
            res = sufMin - cnt, used = sufMin;
        }
    }
    cout << res;
    sort(a.begin(), a.end());
    for (auto i: a) {
        if (i == used) continue;
        res += i;
        cout << " " << res;
    }
    cout << "\n";
    return;

}

int32_t main() {
    int TC = 1;
    for (cin >> TC; TC; TC--)
        solve();
    return 0;
}