/*
yaswanth phani kommineni
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mpa make_pair
#define endl '\n'

void solve(){
	ll n,m;
	cin >> n >> m;
	vector <ll> v(n);
	for(ll i=0;i<n;i++){
		cin >> v[i];
	}
	vector <pair<ll,char>> o,e;
	for(ll i=0;i<n;i++){
		char c;
		cin >> c;
		if(v[i]&1){
			o.pb(mpa(v[i],c));
		}
		else{
			e.pb(mpa(v[i],c));
		}
	}
	map <ll,ll> ans;
	vector <ll> cur,lag;
	sort(o.begin(),o.end());
	sort(e.begin(),e.end());
	for(ll i=0;i<(ll)o.size();i++){
		if(o[i].second == 'L'){
			if(cur.empty()){
				lag.pb(o[i].first);
			}
			else{
				ans[o[i].first] = ans[cur.back()] = (o[i].first-cur.back())/2;
				cur.pop_back();
			}
		}
		else{
			cur.pb(o[i].first);
		}
	}
	while((ll)cur.size()>=2){
		ll a = cur.back();
		cur.pop_back();
		ll b = cur.back();
		cur.pop_back();
		ans[a] = (m-a+m-b)/2;
		ans[b] = (m-a+m-b)/2;
	}
	reverse(lag.begin(),lag.end());
	while((ll)lag.size()>=2){
		ll a = lag.back();
		lag.pop_back();
		ll b = lag.back();
		lag.pop_back();
		ans[a] = (a+b)/2;
		ans[b] = (a+b)/2;
	}
	if((ll)lag.size() && (ll)cur.size()){
		ll a = lag.front();
		lag.pop_back();
		ll b = cur.back();
		cur.pop_back();
		ans[a] = ans[b] = (2*m-b+a)/2;
	}
	if((ll)lag.size()){
		ans[lag.back()] = -1;
	}
	if((ll)cur.size()){
		ans[cur.back()] = -1;
	}
	o = e;
	cur.clear();
	lag.clear();
	for(ll i=0;i<(ll)o.size();i++){
		if(o[i].second == 'L'){
			if(cur.empty()){
				lag.pb(o[i].first);
			}
			else{
				ans[o[i].first] = ans[cur.back()] = (o[i].first-cur.back())/2;
				cur.pop_back();
			}
		}
		else{
			cur.pb(o[i].first);
		}
	}
	while((ll)cur.size()>=2){
		ll a = cur.back();
		cur.pop_back();
		ll b = cur.back();
		cur.pop_back();
		ans[a] = (m-a+m-b)/2;
		ans[b] = (m-a+m-b)/2;
	}
	reverse(lag.begin(),lag.end());
	while((ll)lag.size()>=2){
		ll a = lag.back();
		lag.pop_back();
		ll b = lag.back();
		lag.pop_back();
		ans[a] = (a+b)/2;
		ans[b] = (a+b)/2;
	}
	if((ll)lag.size() && (ll)cur.size()){
		ll a = lag.front();
		lag.pop_back();
		ll b = cur.back();
		cur.pop_back();
		ans[a] = ans[b] = (2*m-b+a)/2;
	}
	if((ll)lag.size()){
		ans[lag.back()] = -1;
	}
	if((ll)cur.size()){
		ans[cur.back()] = -1;
	}
	for(ll i=0;i<n;i++){
		cout << ans[v[i]] << " ";
	}
	cout << endl;
}

int main(){
	//freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tc;
	tc = 1;
	cin >> tc;
	for(int i=1;i<=tc;i++){
		solve();
	}
	return 0;
}
