#include <bits/stdc++.h>
#ifdef LOCAL_TEST
  #pragma comment(linker, "/stack:16777216")
#endif

using namespace std;

typedef long long int ll;
typedef vector <ll> vll;
typedef vector <ll> vi;
typedef pair<int, int> pp;
typedef vector<pp > vpp;

#define sz(a) (int)((a).size())
#define pb push_back
#define mp(a, b)       (make_pair(a, b) )
#define all(c)        (c).begin(),(c).end()
#define fill(a)       (memset(a, 0, sizeof (a)))
#define fillA(a)       (memset(a, -1, sizeof (a)))
#define rep(i,n)     for(int i=0;i<(n);++i)
#define repA(i,a,n) for(int i=a;i<=(n);++i)
#define repD(i,a,n) for(int i=a;i>=(n);--i)
const long double PI = 3.141592653589793238462643383;
#define X first
#define Y second
#define endl '\n'

// Functions
struct Rcompare{bool operator()(pp lhs,pp rhs){return lhs.X>rhs.X;}};
struct compare{bool operator()(pp lhs,pp rhs){return lhs.X<rhs.X;}};
// clock_t tm=clock();void fin(){tm=clock()-tm;cerr<<(float)(tm)/CLOCKS_PER_SEC<<"\n";}
ll gcd(ll a,ll b){if (a==0) return b;return gcd(b%a,a);}
ll lcm(ll a,ll b){return a*(b/gcd(a,b));}
ll Abs(ll a){if(a>0)return a;return -a;}
ll Ceil(ll a,ll b){if(a%b==0)return a/b;else return a/b+1;}
double Abs(double a){if(a>0)return a;return -a;}

ll pow(ll x,ll y)
{
  if(y==0)return 1;
  ll tmp=pow(x,y/2);
  if(y%2==1)return ((tmp*tmp)*x);
  return (tmp*tmp);
}
const int MAX = 500009;
const int MOD = 1e9+7;

const int inf = 1e9;

struct Node {
  Node *l = 0, *r = 0;
  int lo,hi,mset = inf,madd = 0,val = -inf;
  Node(int lo,int hi):lo(lo),hi(hi){} // Large interval ofinf
  Node(vi& v,int lo,int hi) : lo(lo), hi(hi)
  {
    if(lo+1<hi)
    {
      int mid=lo+(hi-lo)/2;
      l=new Node(v,lo,mid);r=new Node(v,mid,hi);
      val=max(l->val,r->val);
    }
    else val=v[lo];
  }
  int query(int L,int R)
  {
    if(R<=lo||hi<=L)return -inf;
    if(L<=lo&&hi<=R)return val;
    push();
    return max(l->query(L,R),r->query(L,R));
  }
  void set(int L,int R,int x)
  {
    if(R<=lo||hi<=L)return;
    if(L<=lo&&hi<=R)mset=val=x,madd=0;
    else
    {
      push(),l->set(L,R,x),r->set(L,R,x);
      val=max(l->val,r->val);
    }
  }
  void add(int L,int R,int x)
  {
    if(R<=lo||hi<=L)return;
    if(L<=lo&&hi<=R)
    {
      if(mset!=inf)mset+=x;
      else madd+=x;

      val+=x;
    }
    else
    {
      push(),l->add(L,R,x),r->add(L,R,x);
      val=max(l->val,r->val);
    }
  }
  void push()
  {
    if(!l)
    {
      int mid=lo+(hi-lo)/2;
      l=new Node(lo,mid);r=new Node(mid,hi);
    }
    if(mset != inf)
      l->set(lo,hi,mset),r->set(lo,hi,mset),mset=inf;
    else if(madd)
      l->add(lo,hi,madd),r->add(lo,hi,madd),madd=0;
  }
};


int ddp[MAX]={0},s[MAX];char tmp[MAX];

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    #ifdef LOCAL_TEST
    ifstream cin("in.txt");ofstream cout("out.txt");//tm=clock();
    #endif

    vi a,b;rep(i,MAX)a.pb(0),b.pb(0);
    Node* ta = new Node(a,0,sz(a));
    Node* tb = new Node(b,0,sz(b));

    int t;cin>>t;
    rep(i,t)
    {
      int m,n;cin>>m>>n;
      vpp ani[2];
      rep(i,n)cin>>tmp[i];
      rep(i,n)cin>>s[i];
      rep(i,n)
      {
        int d;cin>>d;
        if(tmp[i]=='C'||tmp[i]=='E')
        {
          if(s[i]<=d)ani[0].pb(mp(d,s[i]));
        }
        else
        {
          if(s[i]<=d)ani[1].pb(mp(d,s[i]));
        }
      }
      sort(all(ani[0])),sort(all(ani[1]));

      ta->set(0,m+5,0),tb->set(0,m+5,0);

      ll j=0,k=0;
      repA(i,1,m)
      {
        while(j<sz(ani[0])&&ani[0][j].X==i)
        {
          ta->add(1,ani[0][j].Y+1,1);
          j++;
        }
        while(k<sz(ani[1])&&ani[1][k].X==i)
        {
          tb->add(1,ani[1][k].Y+1,1);
          k++;
        }
        int dp=max(ta->query(1,i+1),tb->query(1,i+1));
        // cout<<i<<" "<<dp<<endl;
        ta->set(i,i+1,dp),tb->set(i,i+1,dp);
        ddp[i]=dp;
      }

      int cur=1,ff=0;
      repA(i,1,m)
      {
        while(ddp[i]>=cur)
        {
          if(cur>n)ff=1;
          cout<<i<<' ';
          cur++;
        }
        if(ff==1)break;
      }
      while(cur<=n)cout<<-1<<' ',cur++;
      cout<<endl;

    }


    return 0;
}