#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000000
#define INF 1e18
#define pb push_back
#define F first
#define S second
#define ll long long
#define pi pair<ll,ll>
#define sc(x) scanf("%lld",&x)
ll type[50010];
ll source[50010];
vector<ll> dest1[50010];
vector<ll> dest2[50010];
ll ans[50010];
vector<ll> tree1[200010];
vector<ll> tree2[200010];
void build_tree(ll node, ll a, ll b) {
  	if(a > b) return; 
  	if(a == b) { 
  		for(ll i:dest1[a]){
  			tree1[node].push_back(i);
  		}
  		for(ll i:dest2[a]){
  			tree2[node].push_back(i);
  		}
   		return;
	}
	build_tree(node*2, a, (a+b)/2);
	build_tree(node*2+1, 1+(a+b)/2, b);
	tree1[node].resize(tree1[node*2].size()+tree1[node*2+1].size());
	tree2[node].resize(tree2[node*2].size()+tree2[node*2+1].size());
	merge(tree1[node*2].begin(),tree1[node*2].end(),tree1[node*2+1].begin(),tree1[node*2+1].end(),tree1[node].begin());
	merge(tree2[node*2].begin(),tree2[node*2].end(),tree2[node*2+1].begin(),tree2[node*2+1].end(),tree2[node].begin());
	// cout<<"node "<<a<<" "<<b<<endl;
	// for(ll i:tree1[node]){
	// 	cout<<i<<" ";
	// }
	// cout<<endl;
	// for(ll i:tree2[node]){
	// 	cout<<i<<" ";
	// }
	// cout<<endl;
}
pair<ll,ll> query_tree(ll node, ll a, ll b, ll i, ll j) {
	
	if(a > b || a > j || b < i) return {0,0};

	if(a >= i && b <= j){
		ll cnt1=lower_bound(tree1[node].begin(),tree1[node].end(),i)-tree1[node].begin();
		ll cnt2=lower_bound(tree2[node].begin(),tree2[node].end(),i)-tree2[node].begin();
		// cout<<a<<" "<<b<<" "<<i<<" "<<j<<" "<<cnt1<<" "<<cnt2<<endl;
		return {tree1[node].size()-cnt1,tree2[node].size()-cnt2};
	}
	pi q1 = query_tree(node*2, a, (a+b)/2, i, j);
	pi q2 = query_tree(1+node*2, 1+(a+b)/2, b, i, j);
	pi res = {q1.F+q2.F,q1.S+q2.S};
	return res;
}
int main(){
	ll t,n,m,temp;
	char c;
	sc(t);
	while(t--){
		scanf("%lld%lld",&m,&n);
		for(int i=0;i<n;i++){
			cin>>c;
			if(c=='E'){
				type[i]=0;
			}
			else if(c=='D'){
				type[i]=1;
			}
			else if(c=='C'){
				type[i]=0;
			}
			else{
				type[i]=1;
			}
		}
		for(int i=0;i<n;i++){
			sc(source[i]);
		}
		for(int i=0;i<n;i++){
			sc(temp);
			if(type[i]==0){
				dest1[temp].push_back(source[i]);	
			}
			else{
				dest2[temp].push_back(source[i]);
			}
		}
		for(int i=1;i<=m;i++){
			sort(dest1[i].begin(), dest1[i].end());
			sort(dest2[i].begin(), dest2[i].end());
		}
		build_tree(1,0,m);
		ans[0]=0;
		ll curr=1;
		for(int i=1;i<=m;i++){
			ans[i]=0;
			for(int j=0;j<i;j++){
				pi res=query_tree(1,0,m,j+1,i);
				// cout<<j+1<<" "<<i<<" "<<res.F<<" "<<res.S<<endl;
				ans[i]=max(ans[i],ans[j]+max(res.F,res.S));
			}
			// cout<<ans[i]<<" ";
			while(ans[i]>=curr){
				cout<<i<<" ";
				curr++;
			}
		}
		while(curr<=n){
			cout<<-1<<" ";
			curr++;
		}
		cout<<endl;
		for(int i=1;i<=m;i++){
			dest1[i].clear();
			dest2[i].clear();
		}
		for(int i=0;i<=4*m;i++){
			tree1[i].clear();
			tree2[i].clear();
		}

	}
}