#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define mod 1000000000
#define pb push_back


vector<int>a[51234],b[51234];
int dp[51234];

int segTreea[212345],segTreeb[212345],lazya[212345],lazyb[212345];


void init()
{
	for(int i=0;i<51234;i++){
		a[i].clear();
		b[i].clear();
		dp[i]=-1;
	}
	for(int i=0;i<212345;i++){
		segTreeb[i]=0;
		segTreea[i]=0;
		lazya[i]=0;
		lazyb[i]=0;
	}
	return ;
}

void updatea(int low,int high,int qlow,int qhigh,int pos,int val)
{
	if(lazya[pos]!=0)
	{
		segTreea[pos]+=lazya[pos];
		if(low!=high)
		{
			lazya[2*pos+1]+=lazya[pos];
			lazya[2*pos+2]+=lazya[pos];			
		}
		lazya[pos]=0;
	}
	if(low>qhigh || high<qlow)
		return;
	if(qlow<=low && high<=qhigh)
	{
		segTreea[pos]+=val;
		if(low!=high)
		{
			lazya[2*pos+1]+=val;
			lazya[2*pos+2]+=val;
		}
		return ;
	}
	int mid=(low+high)/2;
	updatea(low,mid,qlow,qhigh,2*pos+1,val);
	updatea(mid+1,high,qlow,qhigh,2*pos+2,val);
	segTreea[pos]=max(segTreea[2*pos+1],segTreea[2*pos+2]);
	return ;
}
int querya(int low,int high,int qlow,int qhigh,int pos)
{
	if(low>qhigh || high<qlow)
		return 0;
	if(lazya[pos]!=0)
	{
		segTreea[pos]+=lazya[pos];
		if(low!=high)
		{
			lazya[2*pos+1]+=lazya[pos];
			lazya[2*pos+2]+=lazya[pos];			
		}
		lazya[pos]=0;
	}

	if(qlow<=low && high<=qhigh)
		return segTreea[pos];
	int mid=(low+high)/2;
	return max(querya(low,mid,qlow,qhigh,2*pos+1),querya(mid+1,high,qlow,qhigh,2*pos+2));
}


void updateb(int low,int high,int qlow,int qhigh,int pos,int val)
{
	if(lazyb[pos]!=0)
	{
		segTreeb[pos]+=lazyb[pos];
		if(low!=high)
		{
			lazyb[2*pos+1]+=lazyb[pos];
			lazyb[2*pos+2]+=lazyb[pos];			
		}
		lazyb[pos]=0;
	}
	if(low>qhigh || high<qlow)
		return;
	if(qlow<=low && high<=qhigh)
	{
		segTreeb[pos]+=val;
		if(low!=high)
		{
			lazyb[2*pos+1]+=val;
			lazyb[2*pos+2]+=val;
		}
		return ;
	}
	int mid=(low+high)/2;
	updateb(low,mid,qlow,qhigh,2*pos+1,val);
	updateb(mid+1,high,qlow,qhigh,2*pos+2,val);
	segTreeb[pos]=max(segTreeb[2*pos+1],segTreeb[2*pos+2]);
	return ;
}
int queryb(int low,int high,int qlow,int qhigh,int pos)
{
	if(low>qhigh || high<qlow)
		return 0;
	if(lazyb[pos]!=0)
	{
		segTreeb[pos]+=lazyb[pos];
		if(low!=high)
		{
			lazyb[2*pos+1]+=lazyb[pos];
			lazyb[2*pos+2]+=lazyb[pos];			
		}
		lazyb[pos]=0;
	}

	if(qlow<=low && high<=qhigh)
		return segTreeb[pos];
	int mid=(low+high)/2;
	return max(queryb(low,mid,qlow,qhigh,2*pos+1),queryb(mid+1,high,qlow,qhigh,2*pos+2));
}

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

		int s[n+5],e[n+5];
		char lol[n+5];

		for(int i=0;i<n;i++)
			cin >> lol[i];

		for(int i=0;i<n;i++)
			cin >> s[i];

		for(int i=0;i<n;i++)
			cin >> e[i];

		for(int i=0;i<n;i++)
		{
			if(lol[i]=='E' || lol[i]=='C')
			{
				if(s[i]<e[i])
					a[e[i]].pb(s[i]);
			}
			else
			{
				if(s[i]<e[i])
					b[e[i]].pb(s[i]);
			}
		}
		for(int i=0;i<51234;i++)
		{
			sort(a[i].begin(),a[i].end());
			reverse(a[i].begin(),a[i].end());
			sort(b[i].begin(),b[i].end());
			reverse(b[i].begin(),b[i].end());
		}

		dp[0]=0;

		for(int i=1;i<=m;i++)
		{
			int ans=0;
			for(int j=0;j<a[i].size();j++)
			{
				updatea(0,m,1,a[i][j],0,1);
			}
			for(int j=0;j<b[i].size();j++)
			{
				updateb(0,m,1,b[i][j],0,1);
			}
			ans=max(ans,querya(0,m,1,m,0));
			ans=max(ans,queryb(0,m,1,m,0));
			//cout << ans << endl;
			dp[i]=max(ans,dp[i-1]);
			updatea(0,m,i,i,0,dp[i]);
			updateb(0,m,i,i,0,dp[i]);
			//cout << "dp[i] "  <<  dp[i] << endl;;
		}
		for(int i=1;i<=n;i++)
		{
			int k=lower_bound(dp,dp+m+1,i)-dp;
			if(k<=m)
				cout << k << " ";
			else
				cout <<  -1 << " ";
		}
		cout<< endl;
	}
}