#include <bits/stdc++.h>
using namespace std;


int main(){
	int t;
	cin>>t;
	while(t--){
		int n,m,i;
		cin>>m>>n;

		vector <int > v[2][50005];
		char c;
		int ar[n];
		int s[n];
		//int dr[n];
		int x;
		for(i=0;i<n;i++){
			cin>>c;
			if(c=='E'||c=='C'){
				ar[i]=0;
			}
			else
				ar[i]=1;
		}
		for(i=0;i<n;i++){
			cin>>s[i];
		}
		for(i=0;i<n;i++){
			cin>>x;
			if(s[i]>x)
				continue;
			//cout<<"hi "<<ar[i]<<endl;
			v[ar[i] ][x].push_back(s[i]);
			//cout<<"hi"<<endl;
		}

		for(i=0;i<m;i++){
			sort(v[0][i].begin(),v[0][i].end());
			sort(v[1][i].begin(),v[1][i].end());
		}

		//int br[m+1];
		int j;
		int ans[3][m+1];
		ans[0][0]=0;
		ans[1][0]=0;
		for(i=1;i<=m;i++){
			
			int ma=ans[0][i-1]+v[0][i].size();
			for(j=v[0][i].size()-1;j>=0;j--){
				int w=v[0][i].size();
				ma = max( (ans[1][(v[0][i][j])] + w - j) ,ma );
			}
			ans[0][i] = ma;


			ma=ans[1][i-1]+v[1][i].size();
			for(j=v[1][i].size()-1;j>=0;j--){
				int w=v[1][i].size();
				ma = max( ans[0][(v[1][i][j])] + w-j ,ma );
			}
			ans[1][i] = ma;

			ans[2][i]=max(ans[0][i],ans[1][i]);
		}

		j=0;
		for(i=1;i<=m;i++){
			while(j<ans[2][i]){
				ar[j]=i;
				j++;
			}
		}

		for(;j<n;j++)
			ar[j]=-1;		
		for(i=0;i<n;i++)
			cout<<ar[i]<<' ';
		cout<<endl;
	}
	return 0;
}