#include <bits/stdc++.h>
#define MAX 50001
using namespace std;
int idx(char ch)
{
    if(ch=='E')return 0;
    else if(ch=='D')return 1;
    else if(ch=='C')return 2;
    else return 3;
}
vector <int> minimumZooNumbers(int m, int n, vector <char> t, vector <int> s, vector <int> d) {
    // Return a list of length n consisting of the answers
    vector<vector<int> > dp(m+1, vector<int>(2, 0));
    vector<vector<int> > source(m+1, vector<int> (4, 0));
    vector<vector<int> > dest(m+1, vector<int> (4, 0));
    vector<vector<int> > cnt(m+1, vector<int> (4, 0));
    vector<int> mans(m+1);
    int i, j;
    for(i=0;i<n;i++)
    {
        source[s[i]+1][idx(t[i])]++;
        dest[d[i]][idx(t[i])]++;
    }
    for(i=1;i<=m;i++)
    {
        int x, y;
        for(j=0;j<4;j++)
            cnt[i][j]=cnt[i-1][j];
        
        for(j=0;j<4;j++)
            cnt[i][j]=cnt[i][j]+source[i][j];
        for(int j=1;j<=i;j++)
        {
            x=dest[i][0]+dest[i][2]+dp[i-j][0];
            y=dest[i][0]+dest[i][2]+dp[i-j][1]-cnt[i-j][0]-cnt[i-j][2];
            dp[i][0]=max(dp[i][0], max(x, y));
            x=dest[i][1]+dest[i][3]+dp[i-j][1];
            y=dest[i][1]+dest[i][3]+dp[i-j][0]-cnt[i-j][1]-cnt[i-j][3];
            dp[i][1]=max(dp[i][1], max(x, y));
        }
        for(j=0;j<4;j++)
            cnt[i][j]=cnt[i][j]-dest[i][j];
        mans[i]=max(dp[i][0], dp[i][1]);
        //cout<<i<<" "<<mans[i]<<endl;
    }
    vector<int> ans(n, -1);
    i=1;j=1;
    while(i<=n&&j<=m)
    {
        while(j<=m&&mans[j]<i)j++;
        if(j==m+1)break;
        ans[i-1]=j;
        i++;
    }
    return ans;
}

int main() {
    int cases;
    cin >> cases;
    for(int a0 = 0; a0 < cases; a0++){
        int m;
        int n;
        cin >> m >> n;
        vector<char> t(n);
        for(int t_i = 0; t_i < n; t_i++){
           cin >> t[t_i];
        }
        vector<int> s(n);
        for(int s_i = 0; s_i < n; s_i++){
           cin >> s[s_i];
        }
        vector<int> d(n);
        for(int d_i = 0; d_i < n; d_i++){
           cin >> d[d_i];
        }
        vector <int> result = minimumZooNumbers(m, n, t, s, d);
        for (ssize_t i = 0; i < result.size(); i++) {
            cout << result[i] << (i != result.size() - 1 ? " " : "");
        }
        cout << endl;


    }
    return 0;
}