#include <bits/stdc++.h>
#define test(x) cout<<#x<<" = "<<x<<endl
#define endl '\n'
#define int long long
using namespace std;
const int MAXN = 1e6 + 100, MAX = 1e18;
int n, m;
string s;
int a[MAXN], lst[MAXN], nxt[MAXN], vis[MAXN], ma[MAXN], fst[MAXN], p[MAXN], t[MAXN];

void solve() {
	cin >> n >> m;
	int sum = 0;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
		ma[i] = a[i];
		lst[i] = 0;
	}
	for (int i = 1; i <= n; ++i) {
		fst[i] = MAX;
		vis[i] = 0;
	}
	for (int i = 1; i <= m; ++i) {
		cin >> p[i] >> t[i];
		nxt[lst[t[i]]] = i;
		lst[t[i]] = i;
		fst[t[i]] = min(fst[t[i]], i);
	}
	for (int i = 1; i <= n; ++i)
		nxt[lst[i]] = MAX;
	set<pair<int, int>> q;
	for (int i = 1; i <= n; ++i) {
		q.insert({fst[i], i});
		vis[i] = fst[i];
	}
	for (int i = 1; i <= m; ++i) {
		for (int i = 1; i <= n; ++i)
			cout << a[i] << " \n"[i == n];
		int d = p[i] - p[i - 1];
		while (!q.empty()) {
			auto [pos, id] = *q.begin();
			if (a[id] > d) {
				a[id] -= d;
				d = 0;
				break;
			} else {
				d -= a[id];
				a[id] = 0;
				q.erase({pos, id});
				vis[id] = 0;
			}
		}
		if (d > 0) {
			cout << p[i] - d << endl;
			return ;
		}
		a[t[i]] = ma[t[i]];
		q.erase({vis[t[i]], t[i]});
		cout << nxt[i] << ' ' << t[i] << endl;
		q.insert({nxt[i], t[i]});
		vis[t[i]] = nxt[i];
	}
	sum = 0;
	for (int i = 1; i <= n; ++i) {
		cout << a[i] << " \n"[i == n];
		sum += max(0ll, a[i]);
	}
	test(sum);
	cout << p[m] + sum << endl;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt = 1;
	cin >> tt;
	while (tt--)
		solve();
}