#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int n; cin >> n;
	ll k; cin >> k;
	ll t; cin >> t;
	t %= k * 2;
	vector<char> a(n);
	vector<ll> b(n);
	rep(i,0,n) cin >> a[i];
	rep(i,0,n) cin >> b[i];
	
	vector<ll> c(n);
	rep(i,0,n){
		if (a[i] == 'A'){
			c[i] = (b[i] - t + k * 2) % (k * 2);
			if (c[i] >= k){
				c[i] = 2 * k - c[i];
			}
		}else{
			c[i] = (b[i] + t) % (k * 2);
			if (c[i] >= k){
				c[i] = 2 * k - c[i];
			}
		}
	}
	sort(c.begin(), c.end());
	vector<pair<ll,int>> bi(n);
	rep(i,0,n){
		bi[i] = pair(b[i], i);
	}
	sort(bi.begin(), bi.end());
	vector<ll> ans(n);
	rep(i,0,n){
		ans[bi[i].second] = c[i];
	}
	rep(i,0,n){
		cout << ans[i] << ' ';
	}
	cout << endl;
}