#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
vector<pair<char,int> >add[MAXN];
char arr[MAXN];
int dm[MAXN],ec[MAXN],l[MAXN],both[MAXN];
struct BIT{
	int lazy[MAXN<<2],s[MAXN<<2];
	void clear(){
		memset(lazy,0,sizeof lazy);
		memset(s,0,sizeof s);
	}
	void shift(int nd){
		int &ret=lazy[nd];
		if(!ret)
			return;
		lazy[nd<<1]+=ret;s[nd<<1]+=ret;	
		lazy[nd<<1|1]+=ret;s[nd<<1|1]+=ret;	
		ret=0;
	}
	void inc(int l,int r,int v,int nd,int x,int y){
		if(l>y or x>r)	
			return;
		if(l<=x and y<=r){
			lazy[nd]+=v;
			s[nd]+=v;
			return;
		}
		shift(nd);
		int mid=(x+y)>>1;
		inc(l,r,v,nd<<1,x,mid);
		inc(l,r,v,nd<<1|1,mid+1,y);
		s[nd]=max(s[nd<<1],s[nd<<1|1]);
	}
	int tap(int l,int r,int nd,int x,int y){
		if(l>y or x>r)
			return 0;
		if(l<=x and y<=r)
			return s[nd];
		shift(nd);
		int mid=(x+y)>>1;
		return max(tap(l,r,nd<<1,x,mid),tap(l,r,nd<<1|1,mid+1,y));	
	}
}DM,EC;
int main(){
    //~ freopen("file.in", "r", stdin);
    int t;
    scanf("%d",&t);
    while(t--){
		DM.clear();
		EC.clear();
		int m,n;
		scanf("%d%d",&m,&n);
		for(int i=1;i<=n;i++)
			scanf(" %c",&arr[i]);
		for(int i=1;i<=n;i++)
			scanf("%d",&l[i]);
		for(int i=1;i<=n;i++){
			int x;
			scanf("%d",&x);
			if(l[i]<x)
				add[x].pb(mp(arr[i],l[i]));
		}	
		for(int i=1;i<=m;i++){
			tr(it,add[i]){
				if(it->ff=='E' or it->ff=='C')
					EC.inc(1,it->ss,+1,1,1,m);
				else
					DM.inc(1,it->ss,+1,1,1,m);
			}
			dm[i]=DM.tap(1,i,1,1,m);
			ec[i]=EC.tap(1,i,1,1,m);
			both[i]=max(dm[i],ec[i]);
			EC.inc(i,i,dm[i],1,1,m);
			DM.inc(i,i,ec[i],1,1,m);
		}
		for(int i=1;i<=m;i++)	
			add[i].clear();
		int p=1;
		for(int i=1;i<=n;i++){
			while(p<=m and both[p]<i)
				p++;
			if(p>m)
				printf("-1 ");
			else
				printf("%d ",p);
		}puts("");
	}
	return 0;
}