#include<bits/stdc++.h>
using namespace std;
int n,m;
struct animal
{
	int type;
	int s;
	int d;
}animals[500005];
map<char,int>typeMap;
int times[500005];
vector< pair<int,int> >dislike;
map< pair<int,pair<int,int> >,int>dp;
bool cmp(animal x , animal y)
{
	return x.d<y.d;
}
int calc(int i,int mask,int finishTimes[],int endTime)
{
	if(i==n)
		return 0;
	int correctMask=mask;
	if(finishTimes[0]<=animals[i].s)
	{
		correctMask=correctMask & (~(1<<0));
	}
	if(finishTimes[1]<=animals[i].s)
	{
		correctMask=correctMask & (~(1<<1));
	}
	if(finishTimes[2]<=animals[i].s)
	{
		correctMask=correctMask & (~(1<<2));
	}
	if(finishTimes[3]<=animals[i].s)
	{
		correctMask=correctMask & (~(1<<3));
	}
	if(animals[i].d>endTime)
		return 0;
	if(dp.find(make_pair(mask,make_pair(i,endTime)))!=dp.end())
	{
		return dp[make_pair(mask,make_pair(i,endTime))];
	}
	int l=0,r=0;
	int bit1=dislike[animals[i].type].first;
	int bit2=dislike[animals[i].type].second;
	if( ( !(correctMask & (1<<bit1) ) ) && ( ! (correctMask &(1<<bit2) ) ) )
	{
		int org=finishTimes[animals[i].type];
		finishTimes[animals[i].type]=animals[i].d;
		l=calc(i+1,correctMask|(1<<animals[i].type),finishTimes,endTime)+1;
		finishTimes[animals[i].type]=org;
	}
	r=calc(i+1,correctMask,finishTimes,endTime);
	return dp[make_pair(mask,make_pair(i,endTime))]=max(l,r);
}
int main()
{
	int t;
	scanf("%d",&t);
	typeMap['E']=0;
	typeMap['D']=1;
	typeMap['C']=2;
	typeMap['M']=3;
	dislike.push_back(make_pair(1,3));
	dislike.push_back(make_pair(0,2));
	dislike.push_back(make_pair(1,3));
	dislike.push_back(make_pair(0,2));
	while(t--)
	{
		scanf("%d%d",&m,&n);
		memset(times,0,sizeof(times));
		dp.clear();
		for(int i=0;i<n;i++)
		{
			char c[2];
			scanf("%s",c);
			animals[i].type=typeMap[c[0]];
		}
		for (int i = 0; i < n; ++i)
		{
			int s;
			scanf("%d",&s);
			animals[i].s=s;
		}
		for (int i = 0; i < n; ++i)
		{
			int d;
			scanf("%d",&d);
			animals[i].d=d;
		}
		sort(animals,animals+n,cmp);
		for(int i=1;i<=m;i++)
		{
			int finishTimes[]={0,0,0,0};
			times[i]=calc(0,0,finishTimes,i);
		}
		vector<int>ans;
		int required=1;
		for(int i=1;i<=m;i++)
		{
			while(times[i]>=required)
			{
				ans.push_back(i);
				required++;
			}
		//	printf("%d ",times[i] );
		}
		//printf("\n\n");
		int i=0;
		for(;i<ans.size();i++)
		{
			printf("%d ",ans[i] );
		}
		for(;i<n;i++)
		{
			printf("-1 ");
		}
		printf("\n");
	}
	return 0;
}