#include <bits/stdc++.h>
#define task "test"
#define X first
#define Y second

using namespace std;

const int N=5E4+120;
struct def
{
	int l, r, ty;
	bool operator < (const def &a) {
		if(r==a.r)return l<a.l; else
		return r<a.r;
	}
} a[N], b[N];
int n_, needUpd[N*5][3], it_max[N*5][3], dp[N], m, n, k; bool ok[N]; 

void Read()
{
	cin >> m >> n; n_=n; n=0;
        for(int i=1; i<=n_; ++i)
		{
			char c; cin>>c; 
			if(c=='D' || c=='M')b[i].ty=1;
			if(c=='E' || c=='C')b[i].ty=2;
		}
        for(int i=1; i<=n_; ++i)cin>>b[i].l;
        for(int i=1; i<=n_; ++i)cin>>b[i].r;
        for(int i=1; i<=n_; ++i)if(b[i].l<=b[i].r)a[++n]=b[i];
        sort(a+1, a+1+n);
}

void updatePos (int node, int l, int r, int pos, int id)
{
	if( needUpd[node][id] )
	{
		it_max[node][id] += needUpd[node][id];
		if(l<r)
		{
			needUpd[node*2][id] += needUpd[node][id];
			needUpd[node*2+1][id] += needUpd[node][id];
		}
		needUpd[node][id]=0;
	}
	if(l > pos || r < pos)return;
	if(pos<= l && r <=pos)
	{
		it_max[node][id] = dp[pos];
	} else
	{
		int mid = (l+r)/2;
		updatePos (node*2, l, mid, pos, id);
		updatePos (node*2+1, mid+1, r, pos, id);
		it_max[node][id] = max(it_max[node*2][id], it_max[node*2+1][id]);
	}
}

void update (int node, int l, int r, int L, int R, int id)
{
	if( needUpd[node][id] )
	{
		it_max[node][id] += needUpd[node][id];
		if(l<r)
		{
			needUpd[node*2][id] += needUpd[node][id];
			needUpd[node*2+1][id] += needUpd[node][id];
		}
		needUpd[node][id]=0;
	}
	if(l > R || r < L)return;
	if(L<= l && r <=R)
	{
		it_max[node][id] += 1;
		if(l<r)
		{
			needUpd[node*2][id] += 1;
			needUpd[node*2+1][id] += 1;
		}
	} else
	{
		int mid = (l+r)/2;
		update (node*2, l, mid, L, R, id);
		update (node*2+1, mid+1, r, L, R, id);
		it_max[node][id] = max(it_max[node*2][id], it_max[node*2+1][id]);
	}
}

int get (int node, int l, int r, int L, int R, int id)
{
	if( needUpd[node][id] )
	{
		it_max[node][id] += needUpd[node][id];
		if(l<r)
		{
			needUpd[node*2][id] += needUpd[node][id];
			needUpd[node*2+1][id] += needUpd[node][id];
		}
		needUpd[node][id]=0;
	}
	if(l > R || r < L)return 0;
	if(L<= l && r <=R)
	{
		return it_max[node][id];
	} else
	{
		int ret = 0;
		int mid = (l+r)/2;
		ret = get (node*2, l, mid, L, R, id);
		ret = max( ret, get (node*2+1, mid+1, r, L, R, id) );
		it_max[node][id] = max(it_max[node*2][id], it_max[node*2+1][id]);
		return ret;
	}
}

void Solve()
{
	memset(it_max, 0, sizeof(it_max));
	memset(needUpd, 0, sizeof(needUpd));
	memset(dp, 0, sizeof(dp));
	int ini=0;
	for(int i=1; i<=m; ++i)
	{
			while(ini<=n && a[ini].r<i) ++ini;
			if(ini>n || a[ini].r>i);
			 else
			while(ini<=n && a[ini].r==i)
			{
				update(1, 1, m,  1, a[ini].l, a[ini].ty); 
				//update(1, 1, m,  1, a[ini].l, 2);
				++ini;
			} //cout<<i<<" index="<<ini<<": "<<" ["<<a[ini].l<<" "<<a[ini].r<<"] "<<endl;
			int max_dp;
			max_dp = get(1, 1, m,  1, i-1, 1); //cout<<1<<": "<<max_dp<<endl;
			if(dp[i] < max_dp)
			{
				dp[i] = max_dp;
				updatePos(1, 1, m,  i, 1);
				updatePos(1, 1, m,  i, 2);
			}
			max_dp = get(1, 1, m,  1, i-1, 2); //cout<<2<<": "<<max_dp<<endl;
			if(dp[i] < max_dp)
			{
				dp[i] = max_dp;
				updatePos(1, 1, m,  i, 1);
				updatePos(1, 1, m,  i, 2);
			}
	}
	
	for(int i=1; i<=n_; ++i)
	{
		int l=1, r=m, mid, ans=-1;
		while(l<=r)
		{
			mid=(l+r)/2;
			if(dp[mid]>=i)
			{
				ans = mid;
				r = mid-1;
			} else l = mid+1;
		}
		cout<<ans<< " ";
	}
	cout<<endl;
}

int main() {
	ios_base::sync_with_stdio(false);
    int cases;
    cin >> cases;
    for(int a0 = 0; a0 < cases; a0++){
        Read();
        Solve();
    }
    return 0;
}