#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int garr[][4]={{1,0,1,0},{0,1,0,1},{1,0,1,0},{0,1,0,1}};

void swap(int *xp, int *yp)
{
    int temp = *xp;
    *xp = *yp;
    *yp = temp;
}
void swap1(char *xp,char *yp)
{
    char temp = *xp;
    *xp = *yp;
    *yp = temp;
}
void bubbleSort(int arr[],int arr1[],char arr2[],int n)
{
   int i, j;
   bool swapped;
   for (i = 0; i < n-1; i++)
   {
     swapped = false;
     for (j = 0; j < n-i-1; j++)
     {
        if (arr[j] > arr[j+1])
        {
           swap(&arr[j], &arr[j+1]);
           swap(&arr1[j], &arr1[j+1]);
           swap1(&arr2[j],&arr2[j+1]);
           swapped = true;
        }
     }

     // IF no two elements were swapped by inner loop, then break
     if (swapped == false)
        break;
   }
}
int doConflict(char x1,char x2,int s1,int d1,int s2,int d2)
{
    if((x1=='E' || x1=='C') && (x2=='E' || x2=='C'))
       {
           return 1;
       }
    else if((x1=='E' || x1=='C') && (x2=='D' || x2=='M'))
        {
            if(d1<=s2)
                return 1;
            else
                return 0;
        }
        else if((x1=='D' || x1=='M') && (x2=='D' || x2=='M'))
        {
            return 1;
        }
        else if((x1=='D' || x1=='M') && (x2=='E' || x2=='C'))
        {
            if(d1<=s2)
                return 1;
            else
                return 0;
        }
        else
        {
            return 1;
        }
   // else if(x1==)
}
int* minimumZooNumbers(int m, int n, char* t, int* s, int* d,int min)
{
    int i,j;

    int *p=malloc(sizeof(int) * n);
    p[0]=min;
    int x=1;
    int y=0;
    int count=0;
    bubbleSort(d,s,t,n);
    int max=0;
    //for(i=0;i<n;i++)
       // printf("%d %d %c\n",d[i],s[i],t[i]);
    int flag=0,flag1=0;
    int ansindex[10000];
    int k;
    while(x<n)
    {
        count=0;
        max=0;

        for(i=0;i<n;i++)
        {
            y=0;
            count=0;
            max=0;
            ansindex[y]=i;
            y++;
            for(j=(i+1);j<n;j++)
            {

                for(k=0;k<y;k++)
                {


                    flag=doConflict(t[ansindex[k]],t[j],s[ansindex[k]],d[ansindex[k]],s[j],d[j]);
                    if(flag==0)
                        break;
                }
                if(flag==0)
                {
                    continue;
                }

                ansindex[y]=j;
                y++;
                count++;

                max=d[j];
                if(count==x)
                {
                    p[x]=max;
                    break;
                }

            }
            if(count==x)
            {

                 p[x]=max;
                break;
            }
            if(((n-(i+1)+count))<x)
            {
                flag1=1;
                break;
            }

        }
        if(i==n || flag1==1)
        {
            p[x]=-1;
            break;
        }

        x++;
    }

    return p;
}


// An optimized version of Bubble Sort

int main() {
    int cases;
    scanf("%i", &cases);
    int a0,t_i,s_i,d_i,result_i;

    for(a0 = 0; a0 < cases; a0++){
        int m,min;
        int n;
        int flag=0;
        scanf("%i %i", &m, &n);
        char *t = malloc(sizeof(char) * n);
       // int *t1=malloc(sizeof(int)*n);
        for ( t_i = 0; t_i < n; t_i++) {
           scanf(" %c",&t[t_i]);
          // t1[t_i]=(int)t[t_i];
        }
        int *s = malloc(sizeof(int) * n);
        for (s_i = 0; s_i < n; s_i++) {
           scanf("%i",&s[s_i]);
        }
        int *d = malloc(sizeof(int) * n);
        for ( d_i = 0; d_i < n; d_i++) {

           scanf("%i",&d[d_i]);
            if(d_i==0)
            {
                min=d[d_i];
            }
            else
            {
                if(d[d_i]<min)
                {
                    min=d[d_i];
                }
            }
        }
        int result_size;
        int* result = minimumZooNumbers(m, n,t,s,d,min);
        for(d_i=0;d_i<n;d_i++)
        {
            if(result[d_i]!=-1 && flag==0)
                printf("%d ",result[d_i]);
            else
            {
                flag=1;
                printf("-1 ");
            }
        }
        printf("\n");

    }
    return 0;
}