#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int Q;
    cin >> Q;
    
    for(int q=0; q<Q; ++q) {
        int m,n;
        cin >> m >> n;
        
        vector<vector<int>> info(n, vector<int>(3));
        
        for(int i=0; i<n; ++i) {
            char c;
            cin >> c;
            info[i][2]=c;
        }
        
        for(int j: {1,0})
        for(int i=0; i<n; ++i) {
            cin >> info[i][j];
        }
        
        for(auto& v: info)
            v[2] = (v[2]=='E'||v[2]=='C' ? 1 : 0);
        
        sort(info.begin(), info.end());
        vector<int> dp(n, 1);
        vector<int> ans(n);
        
        int mx=1;
        
        for(int i=0; i<n; ++i) {
            int maxAlreadyConsideredSource = 0;
            for(int j=i-1; j>=0; --j) {
                if(info[j][0]<maxAlreadyConsideredSource)
                    goto ANSWER;
                
                if(info[j][0]<=info[i][1] || (info[i][2]==info[j][2])) {
                    dp[i]=max(dp[i], dp[j]+1);
                    mx = max(mx, dp[i]);
                    maxAlreadyConsideredSource = max(maxAlreadyConsideredSource, info[j][1]);
                }
            }
            
ANSWER:
            if(!ans[mx-1])
                ans[mx-1] = info[i][0];
        }
        
        int near=-1;
        for(int i=ans.size()-1; i>=0; --i)
            if(ans[i]>0)
                near=ans[i];
            else
                ans[i]=near;
        
        for(int i: ans)
            cout << i << " ";
        cout << endl;
        
    }
    
    return 0;
}