#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sp ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define mod 1000000000
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define inf 1000000000
#define mxn 100005
vector< pair<ll,ll> >graph[mxn];
int main(){
ll t;
cin>>t;
while(t--){

    ll m,n;
    cin>>n>>m;
    ll i,j;
for(i=0;i<mxn;i++)
    graph[i].clear();
    ll type[m+5],src[m+5],dst[m+5];
    for(i=0;i<m;i++){
            char a;
    cin>>a;
    if(a=='E'||a=='C')
        type[i]=1;
        else
            type[i]=2;}
        for(i=0;i<m;i++)
            cin>>src[i];
        for(i=0;i<m;i++)
            cin>>dst[i];
        for(i=0;i<m;i++){
                ll u=dst[i];
                ll v=src[i];
                if(u>v){
                    graph[u].pb(mp(v,type[i]));
                }
            }
        vector<ll>dp(n,0);
        //memset(dp,0,sizeof dp);
        ll sum1[n+5];
        ll sum2[n+5];
        sum1[1]=0;
        sum2[1]=0;
        for(i=2;i<=n;i++){
            int count1=0;
            int count2=0;
            for(j=0;j<graph[i].size();j++){
                int u=graph[i][j].first;
                int a=graph[i][j].second;
                if(a==1){
                    count1++;
                }
                else
                    count2++;
            }
            sum1[i]=sum1[i-1]+count1;
            sum2[i]=sum2[i-1]+count2;
        }
        for(i=2;i<=n;i++){
            dp[i]=dp[i-1];
            for(j=0;j<graph[i].size();j++){
                int u=graph[i][j].first;
                int a=graph[i][j].second;
                if(a==1){
                    dp[i]=max(dp[i],dp[u]+sum1[i]-sum1[u]);
                }
                else{
                    dp[i]=max(dp[i],dp[u]+sum2[i]-sum2[u]);
                }
            }
        }
    for(i=1;i<=min(m,dp[n]);i++){
                vector<ll>:: iterator it;
            it=lower_bound(dp.begin(),dp.end(),i);
                cout<<it-dp.begin()<<" ";
            }
            for(i=min(m,dp[n])+1;i<=m;i++)
                cout<<-1<<" ";

        cout<<endl;
}
}