#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using P = pair<int, int>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, k, t; cin >> n >> k >> t;
    vector<char> a(n);
    vector<int> b(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++) cin >> b[i];
    vector<P> vp(n);
    for(int i = 0; i < n; i++) {
        vp[i] = {b[i], i};
    }
    sort(vp.begin(), vp.end());

    vector<P> vp1(n);
    for(int i = 0; i < n; i++){
        ll x = a[i] == 'B' ? b[i] : 2*k-b[i];
        x += t;
        x %= 2*k;
        if(x <= k){
            vp1[i] = {x, i};
        }else{
            vp1[i] = {2*k-x, i};
        }
    }
    sort(vp1.begin(), vp1.end());

    vector<int> ans(n);
    for(int i = 0; i < n; i++){
        auto [b, idx0] = vp[i];
        auto [b1, idx1] = vp1[i];
        ans[idx0] = b1;
    }
    print_vector(ans);
}