#include <bits/stdc++.h>
#define fore(x,a,b) for(int x=a, qwe=b; x<qwe; x++)
using namespace std;

const int N=5e4+1;

struct STree {
	vector<int> st,lazy;int n;
	STree(int n): st(4*n+5,0), lazy(4*n+5,0), n(n) {}
	void push(int k, int s, int e){
		if(!lazy[k])return;
		st[k]+=lazy[k];
		if(s+1<e){
			lazy[2*k]+=lazy[k];
			lazy[2*k+1]+=lazy[k];
		}
		lazy[k]=0;
	}
	void upd(int k, int s, int e, int a, int b, int v){
		push(k,s,e);
		if(s>=b||e<=a)return;
		if(s>=a&&e<=b){
			lazy[k]+=v;
			push(k,s,e);return;
		}
		int m=(s+e)/2;
		upd(2*k,s,m,a,b,v);upd(2*k+1,m,e,a,b,v);
		st[k]=max(st[2*k],st[2*k+1]);
	}
	int query(int k, int s, int e, int a, int b){
		if(s>=b||e<=a)return 0;
		push(k,s,e);
		if(s>=a&&e<=b)return st[k];
		int m=(s+e)/2;
		return max(query(2*k,s,m,a,b),query(2*k+1,m,e,a,b));
	}
	void upd(int a, int b, int v){upd(1,0,n,a,b,v);}
	int query(int a, int b){return query(1,0,n,a,b);}
};

char types[N];
int start[N], finish[N], best[N], ans[N];

int main(){ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int T; cin >> T;
    while(T--){
        int m,n; cin >> m >> n;
        memset(ans,-1,sizeof(ans));
        fore(x,0,n)cin>>types[x];
        fore(x,0,n)cin>>start[x];
        fore(x,0,n)cin>>finish[x];
        
        map<int, vector<int> > pos[2];
        fore(x,0,n)if(start[x]<finish[x])
            pos[types[x]=='E' || types[x]=='C'][finish[x]].push_back(start[x]);
        
        STree sts[2] = {STree(m+1), STree(m+1)};
        fore(x,1,m+1){
            fore(y,0,2)
                if(pos[y].count(x))
                    for(int v : pos[y][x])
                        sts[y].upd(0,v+1,1);
            best[x] = max(sts[0].query(0,x),sts[1].query(0,x));
            fore(y,0,2)sts[y].upd(x,x+1,best[x]);
        }
        int i=1;
        fore(x,1,m+1)
            while(i<=best[x])ans[i]=x,i++;
        fore(x,1,n+1)cout << ans[x] << " \n"[x==n];
    }
}