#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;


int main(){
    i64 N, K, T; cin >> N >> K >> T;
    vector<char> A(N);
    vector<i64> B(N);
    rep(i,N) cin >> A[i];
    rep(i,N) cin >> B[i];
    vector<int> I(N); rep(i,N) I[i] = i;
    sort(I.begin(), I.end(), [&](int l, int r){ return B[l] < B[r]; });
    rep(i,N){
        B[i] = K - B[i];
        if(A[i] == 'B') B[i] = 2*K - B[i];
        B[i] += T;
        B[i] %= 2*K;
        B[i] = abs(K - B[i]);
    }
    sort(B.begin(), B.end());
    vector<int> ans(N);
    rep(i,N) ans[I[i]] = B[i];
    rep(i,N){
        if(i) cout << ' ';
        cout << ans[i];
    }
    cout << '\n';
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;