#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define lowbit(x) ((x)&(-x));

typedef long long LL;
typedef pair<int,int> PII;
typedef long double LD;
const int N=2e5+10,M=2e5+10,mod=998244353,INF=0x3f3f3f3f;
int n,m,k,q;
const int maxn=10;
int bat[maxn],batmx[maxn];
void solve(){
    int n,m;
    cin>>n>>m;
    ll sum=0;
    for(int i=1;i<=n;i++) {
        cin>>batmx[i];
        bat[i]=batmx[i];
        sum+=bat[i];
    }
    queue<int> q[maxn],q2;
    for(int i=0;i<m;i++) {
        int x,y;
        cin>>x>>y;
        q[x].push(y);
        q2.push(y);
    }
    set<pair<int,int>> st;
    for(int i=1;i<=n;i++) {
        if(!q[i].empty()) 
            st.insert({q[i].front(),i});
        else st.insert({2e9,i});
    }
    int now=0,cnt=0;
    while(!q2.empty()) {
        cnt++;
        int nd=q2.front()-now;
        q2.pop();
        while(*st.begin().first<cnt) {
            int tmp=(*st.begin()).second;
            st.erase(st.begin());
            q[tmp].pop();
            while(!q[tmp].front()<cnt) {
                q[tmp].pop();
            }
            if(!q[tmp].empty()&&bat[tmp]) {
                st.insert({q[tmp].front(),tmp});
            }
        }
        while(nd) {
            int d=min(nd,bat[*st.begin().first]);
            nd-=d;
            bat[*st.begin().first]-=d;
            if(bat[*st.begin().first]==0) 
                st.erase(st.begin());
        }  }
}
int main() {
    cin.tie(0);
    int _=1;
    cin>>_;
    while(_--) {
        solve();
    }
    return 0;
}

answer.code: In function ‘void solve()’:
answer.code:18:5: error: ‘ll’ was not declared in this scope; did you mean ‘LL’?
   18 |     ll sum=0;
      |     ^~
      |     LL
answer.code:22:9: error: ‘sum’ was not declared in this scope
   22 |         sum+=bat[i];
      |         ^~~
answer.code:42:27: error: ‘std::set<std::pair<int, int> >::iterator’ {aka ‘std::_Rb_tree<std::pair<int, int>, std::pair<int, int>, std::_Identity<std::pair<int, int> >, std::less<std::pair<int, int> >, std::allocator<std::pair<int, int> > >::const_iterator’} has no member named ‘first’
   42 |         while(*st.begin().first<cnt) {
      |                           ^~~~~
answer.code:54:42: error: ‘std::set<std::pair<int, int> >::iterator’ {aka ‘std::_Rb_tree<std::pair<int, int>, std::pair<int, int>, std::_Identity<std::pair<int, int> >, std::less<std::pair<int, int> >, std::allocator<std::pair<int, int> > >::const_iterator’} has no member named ‘first’
   54 |             int d=min(nd,bat[*st.begin().first]);
      |                                          ^~~~~
answer.code:56:29: error: ‘std::set<std::pair<int, int> >::iterator’ {aka ‘std::_Rb_tree<std::pair<int, int>, std::pair<int, int>, std::_Identity<std::pair<int, int> >, std::less<std::pair<int, int> >, std::allocator<std::pair<int, int> > >::const_iterator’} has no member named ‘first’
   56 |             bat[*st.begin().first]-=d;
      |                             ^~~~~
answer.code:57:32: error: ‘std::set<std::pair<int, int> >::iterator’ {aka ‘std::_Rb_tree<std::pair<int, int>, std::pair<int, int>, std::_Identity<std::pair<int, int> >, std::less<std::pair<int, int> >, std::allocator<std::pair<int, int> > >::const_iterator’} has no member named ‘first’
   57 |             if(bat[*st.begin().first]==0)
      |                                ^~~~~