import java.io.*;
import java.util.*;
import java.math.*;
import java.util.concurrent.*;

public final class animal_transport
{
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	static FastScanner sc=new FastScanner(br);
    static PrintWriter out=new PrintWriter(System.out);
	static Random rnd=new Random();
	static ArrayList<Pair>[] events;
	static int[][] tree,lazy;
	
	static void point_update(int node,int s,int e,int l,int r,int idx,int val)
	{
		if(s>e || l>e || r<s)	
		{
			return;
		}
		
		if(s==e)
		{
			tree[idx][node]=val;
		}
		
		else
		{
			int mid=(s+e)>>1;
			
			point_update(node<<1,s,mid,l,r,idx,val);point_update(node<<1|1,mid+1,e,l,r,idx,val);
			
			tree[idx][node]=Math.max(tree[idx][node<<1],tree[idx][node<<1|1]);
		}
	}
	
	static void range_update(int node,int s,int e,int l,int r,int idx,int val)
	{
		if(lazy[idx][node]!=0)
		{
			tree[idx][node]+=lazy[idx][node];
			
			if(s!=e)
			{
				lazy[idx][node<<1]+=lazy[idx][node];
				
				lazy[idx][node<<1|1]+=lazy[idx][node];
			}
			
			lazy[idx][node]=0;
		}
		
		if(s>e || l>e || r<s)
		{
			return;
		}
		
		if(l<=s && r>=e)
		{
			tree[idx][node]+=val;
			
			if(s!=e)
			{
				lazy[idx][node<<1]+=val;lazy[idx][node<<1|1]+=val;
			}
		}
		
		else
		{
			int mid=(s+e)>>1;
			
			range_update(node<<1,s,mid,l,r,idx,val);range_update(node<<1|1,mid+1,e,l,r,idx,val);
			
			tree[idx][node]=Math.max(tree[idx][node<<1],tree[idx][node<<1|1]);
		}
	}
	
	static int query(int node,int s,int e,int l,int r,int idx)
	{
		if(lazy[idx][node]!=0)
		{
			tree[idx][node]+=lazy[idx][node];
			
			if(s!=e)
			{
				lazy[idx][node<<1]+=lazy[idx][node];
				
				lazy[idx][node<<1|1]+=lazy[idx][node];
			}
			
			lazy[idx][node]=0;
		}
		
		if(s>e || l>e || r<s)
		{
			return 0;
		}
		
		if(l<=s && r>=e)
		{
			return tree[idx][node];
		}
		
		else
		{
			int mid=(s+e)>>1;
			
			return Math.max(query(node<<1,s,mid,l,r,idx),query(node<<1|1,mid+1,e,l,r,idx));
		}
	}
	
	@SuppressWarnings("unchecked")
    public static void main(String args[]) throws Exception
    {
		int t=sc.nextInt();
		
		while(t>0)
		{
			int m=sc.nextInt(),n=sc.nextInt();int[] type=new int[n],a=new int[n],b=new int[n];
			
			for(int i=0;i<n;i++)
			{
				char ch=sc.next().charAt(0);
				
				type[i]=(ch=='D' || ch=='M'?0:1);
			}
			
			for(int i=0;i<n;i++)
			{
				a[i]=sc.nextInt()-1;
			}
			
			for(int i=0;i<n;i++)
			{
				b[i]=sc.nextInt()-1;
			}
			
			events=new ArrayList[m];
			
			for(int i=0;i<m;i++)
			{
				events[i]=new ArrayList<>();
			}
			
			for(int i=0;i<n;i++)
			{
				if(a[i]<b[i])
				{
					events[b[i]].add(new Pair(type[i],a[i]));
				}
			}
			
			int[] dp=new int[m];tree=new int[2][4*m];lazy=new int[2][4*m];
			
			for(int i=0;i<m;i++)
			{
				for(Pair p:events[i])
				{
					range_update(1,0,m-1,0,p.l,p.type,1);
				}
				
				dp[i]=Math.max(query(1,0,m-1,0,i-1,0),query(1,0,m-1,0,i-1,1));
				
				point_update(1,0,m-1,i,i,0,dp[i]);point_update(1,0,m-1,i,i,1,dp[i]);
			}
			
		//	out.println(Arrays.toString(dp));
			
			int[] res=new int[n+1];Arrays.fill(res,Integer.MAX_VALUE);
			
			for(int i=0;i<m;i++)
			{
				res[dp[i]]=Math.min(res[dp[i]],i);
			}
			
			for(int i=n-1;i>=0;i--)
			{
				res[i]=Math.min(res[i],res[i+1]);
			}
			
			for(int i=1;i<=n;i++)
			{
				int ans=res[i]<Integer.MAX_VALUE?res[i]+1:-1;
				
				out.print(ans+" ");
			}
			
			out.println("");t--;
		}
		
		out.close();
    }
	
	private static class Pair
	{
		int type,l;
		
		public Pair(int type,int l)
		{
			this.type=type;this.l=l;
		}
	}
}
class FastScanner
{
    BufferedReader in;
    StringTokenizer st;

    public FastScanner(BufferedReader in) {
        this.in = in;
    }
	
    public String nextToken() throws Exception {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
	
	public String next() throws Exception {
		return nextToken().toString();
	}
	
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
}