#include<bits/stdc++.h>
#define ll int
#define vll vector<ll>
#define vpll vector<pair<ll,ll> >
#define mll map<ll,ll>
#define sll set<ll>
#define fo(i,n) for(i=0;i<n;i++)
#define MOD 1000000007
#define mp make_pair
#define pb push_back
using namespace std;

vpll v1,v2;
ll ans[50010];
map<pair<ll,ll>,ll> ma;
void calc(ll i,ll j,ll c)
{
    if(ma.count(mp(i,j)))
        return;

    if(i==v1.size() && j==v2.size())
        return;

    if(i==v1.size())
    {
        while(j<v2.size())
        {
            c++;
            ans[c]=min(ans[c],v2[j].first);j++;
        }
        return;
    }

    if(j==v2.size())
    {
        while(i<v1.size())
        {
            c++;
            ans[c]=min(ans[c],v1[j].first);i++;
        }
        return;
    }
    ans[c+1]=min(ans[c+1],min(v1[i].first,v2[j].first));
    ll i2=i,j2=j;

    while(i2<v1.size() && v1[i2].second<v2[j].first)
        i2++;
    while(j2<v2.size() && v2[j2].second<v1[i].first)
        j2++;

    calc(i+1,j2,c+1);calc(i2,j+1,c+1);
    ma[mp(i,j)]=1;
}

int main()
{
    ios::sync_with_stdio(false);cin.tie(0);

    #ifdef UJJWAL_HOME
        freopen("000.txt","r",stdin);
    #endif

    ll n,i,j,k,t,m,s[50005],e[50005];
    char ch[50005];

    cin>>t;

    while(t--)
    {
        cin>>m>>n;

        //cout<<m<<" "<<n<<endl;
        ma.clear();

        fo(i,n+5)
            ans[i]=m+5;
        fo(i,n)
            cin>>ch[i];
        fo(i,n)
            cin>>s[i];
        fo(i,n)
            cin>>e[i];

        v1.clear(),v2.clear();

        fo(i,n)
        {
            if(ch[i]=='E' || ch[i]=='C')
                v1.pb(mp(e[i],s[i]));
            else
                v2.pb(mp(e[i],s[i]));
        }

        sort(v1.begin(),v1.end());
        sort(v2.begin(),v2.end());

        calc(0,0,0);

        fo(i,n)
        {
            if(ans[i+1]>m)
                cout<<-1<<" ";
            else
                cout<<ans[i+1]<<" ";
        }

        cout<<endl;
    }
    return 0;
}