#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including seg_tree_order_statistics_node_update
#include <stdio.h>
#include <cassert>
using namespace std;
//using namespace __gnu_pbds;
typedef long long lo;
typedef pair<lo,lo> ll;//pair
typedef vector<lo> vl;  //vector of long
typedef vector<ll > vll;   //vector of pair
typedef priority_queue<lo>p_q;
typedef vector< vl > vvl;  //vector of vectors
#define X first
#define Y second
#define mp(a,b) make_pair((a),(b))
#define REP(a,b) for(lo i=(a);i<(lo)b;i++)//no need to declare variable i
#define REPE(a,b,c,d) REP(a,b)for(lo j=(c);j<(lo)d;j++)//no need to declare vaiables i,j
#define REPV(a,b,c) for(lo(a)=b;(a)<(c);(a)++)//a is the variable
#define IREP(a,b) for(lo i=(a);i>=(b);i--)
#define IREPV(a,b,c) for(lo(a)=b;(a)>=(c);(a)--)
#define all(v) (v).begin(),(v).end()
#define TRV(a) for(auto it : a)
#define INF 101000
#define MOD 1000000000
#define M 1000000007
#define CHECK_BIT(var,pos) ((var) & (1<<(pos)))
#define pb(a) push_back((a))
#define endl "\n"
#define eps 1e-9
#define PI 3.141592653589793
template<typename T> ostream& operator<< ( ostream &o,vector<T> v ) {
    if ( v.size() >0 )o<<v[0];
    for ( unsigned   i=1; i<v.size(); i++ )o<<" "<<v[i];
    return o<<endl;
}
template<typename U,typename V> ostream& operator<< ( ostream &o,pair<U,V> p ) {
    return o<<"("<<p.first<<", "<<p.second<<") ";
}
template<typename T> istream& operator>> ( istream &in,vector<T> &v ) {
    for ( unsigned   i=0; i<v.size(); i++ )in>>v[i];
    return in;
}
template<typename T> istream& operator>> ( istream &in,pair <T,T> &p ) {
    in>>p.X;
    in>>p.Y;
    return in;
}
#define debug(x) cout<<#x<<"="<<x<<endl;
int main(){
    std::ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);cout.precision(20);
    lo t;
    cin>>t;
    while(t--){
        lo n,m;
        cin>>m>>n;
        vvl cat(m+1),dog(m+1);
        vl l(n),r(n);
        vector<char>type(n);
        cin>>type>>l>>r;
        REP(0,n){
            if(type[i]=='C' or type[i]=='E')cat[l[i]].pb(r[i]);
            else dog[l[i]].pb(r[i]);
        }
        vl ans1(m+2,0),ans2(m+2,0),ans(m+2,0);
        priority_queue<ll, vll, greater<ll> >q1,q2;
        REP(1,m+1){
            ans1[i]=ans1[i-1];
            ans2[i]=ans2[i-1];
            lo cnt=0;
            while(!q1.empty()){
                if(q1.top().X==i){
                    cnt++;
                    //cout<<i<<"cat"<<q1.top()<<ans1[i-1]<<" "<<ans2[q1.top().Y]<<" "<<cnt<<endl;
                    ans1[i]=max(ans1[i],ans2[q1.top().Y]+cnt);
                    ans1[i]=max(ans1[i],ans1[i-1]+cnt);
                    q1.pop();
                }
                else break;
            }
            cnt=0;
            while(!q2.empty()){
                //cout<<i<<"dog"<<q2.top()<<endl;
                if(q2.top().X==i){
                    cnt++;
                    ans2[i]=max(ans2[i],ans1[q2.top().Y]+cnt);
                    ans2[i]=max(ans2[i],ans2[i-1]+cnt);
                    q2.pop();
                }
                else break;
            }
            TRV(cat[i])q1.push(mp(it,i));
            TRV(dog[i])q2.push(mp(it,i));
        }
        lo cur=0;
        vl res(n+1,-1);
        //debug(ans);
        REP(0,ans.size())ans[i]=max(ans1[i],ans2[i]);
        //cout<<ans;
        REP(0,m+1){
            REPV(j,cur,ans[i]+1)res[j]=i;
            cur=ans[i]+1;
        }
        REP(1,n+1)cout<<res[i]<<" ";
        cout<<endl;
    }
    return 0;
}