#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef set<int> si;
typedef map<int,int> mii;

const int N = 50005;
vector <int> adjList[N], ans;
int dp[N][2],tree[4*N][2],lazy[4*N][2],type[N],s[N],d[N];

void propagate_lazy(int pos, int l,int r,int dim){
    if(!lazy[pos][dim])
        return;
    tree[pos][dim] += lazy[pos][dim];
    if(l != r){
        lazy[2*pos][dim] += lazy[pos][dim];
        lazy[2*pos+1][dim] += lazy[pos][dim];
    }
    lazy[pos][dim] = 0;
}

int query(int pos, int l, int r, int qLow, int qHigh, int dim){
    propagate_lazy(pos,l,r,dim);
    if(qLow > r || qHigh < l)
        return 0;
    if(l >= qLow && r<=qHigh)
        return tree[pos][dim];
    int mid = (l+r)/2;
    return max(query(pos*2,l,mid,qLow,qHigh,dim), query(pos*2+1,mid+1,r,qLow,qHigh,dim));
}

void update(int pos, int l, int r, int qLow, int qHigh, int dim, int v){
    propagate_lazy(pos,l,r,dim);
    if(qLow > r || qHigh < l)
        return;
    if(l >= qLow && r <= qHigh){
        lazy[pos][dim] += v;
        propagate_lazy(pos,l,r,dim);
        return;
    }
    int mid =(l+r)/2;
    update(pos*2,l,mid,qLow,qHigh,dim,v);
    update(pos*2+1,mid+1,r,qLow,qHigh,dim,v);
    tree[pos][dim] = max(tree[pos*2][dim], tree[pos*2+1][dim]);
}

int main(){
    int n,m,t;
    scanf("%d",&t);
    while(t--){
        memset(tree,0,sizeof tree);
        memset(lazy,0,sizeof lazy);
        ans.clear();
        scanf("%d%d",&m,&n);
        for(int i = 1;i<=m;i++)
            adjList[i].clear();
        for(int i = 1;i<=n;i++) {
            char c;
            scanf("%*c%c",&c);
            type[i] = (c == 'D' || c == 'M')?0:1;
        }
        for(int i = 1;i<=n;i++)
            scanf("%d",&s[i]);
        for(int i = 1;i<=n;i++) {
            scanf("%d",&d[i]);
            adjList[d[i]].push_back(i);
        }
        for(int i=1;i<=m;i++){
            for(int j = 0;j<adjList[i].size();j++) {
                int ch = adjList[i][j];
                if(s[ch] < i)
                    update(1,1,m,1,s[ch],!type[ch],1);
            }
            dp[i][0] = query(1,1,m,1,i,1);
            dp[i][1] = query(1,1,m,1,i,0);
            update(1,1,m,i,i,0,dp[i][0]);
            update(1,1,m,i,i,1,dp[i][1]);
        }

        for(int i = 1;i<=m;i++)
            ans.push_back(max(dp[i][0],dp[i][1]));
        for(int i = 1;i<=n;i++) {
            int temp = lower_bound(ans.begin(),ans.end(),i) - ans.begin()+1;
            if(temp == m+1)
                temp = -1;
            printf("%d ",temp);
        }
        if(t)
            printf("\n");

    }
}