//help

// https://atcoder.jp/contests/agc013/tasks/agc013_c

// https://atcoder.jp/contests/agc013/submissions/8287170

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N;
    ll L,T;cin>>N>>L>>T;
    ll G;
    vector<pair<pair<char,ll>,int>> SS(N);
    for(int i=0;i<N;i++) cin>>SS[i].fi.fi;
    for(int i=0;i<N;i++) cin>>SS[i].fi.se;
    for(int i=0;i<N;i++) SS[i].se=i;
    sort(all(SS),[](auto a,auto b){
        return a.fi.se<b.fi.se;
    });
    
    vector<ll> X(N),W(N),goal(N);
    for(int i=0;i<N;i++){
        if(SS[i].fi.fi=='A'){
            W[i]=2;
            X[i]=SS[i].fi.se;
        }
        else{
            W[i]=1;
            X[i]=SS[i].fi.se;
        }
        if(W[i]==1){
            ll t=T%(2*L);
            goal[i]=X[i]+t;
            if(goal[i]>=2*L) goal[i]%=2*L;
            else if(goal[i]>=L) goal[i]=(L+L-goal[i])%L;
            else goal[i]%=L;
        }else{
            ll t=T%(2*L);
            goal[i]=X[i]+2*L-t;
            if(goal[i]>=2*L) goal[i]%=2*L;
            else if(goal[i]>=L) goal[i]=(L+L-goal[i])%L;
            else goal[i]%=L;
            //goal[i]=(L+X[i]-T%L)%L;
        }
        
        if(i==0) G=goal[i];
        
        //cout<<X[i]<<" "<<W[i]<<" "<<goal[i]<<endl;
    }
    sort(all(goal));
    
    ll cnt1=0;
    for(int i=1;i<N;i++){
        ll dis=2*T,z;
        if(W[0]==1){
            if(W[i]==1){
                z=L-X[0]+L-X[i];
            }else{
                z=X[i]-X[0];
            }
        }else{
            if(W[i]==1){
                z=X[0]+(L-X[i])+L;
            }else{
                z=X[0]+X[i];
            }
        }
        
        //cout<<dis<<" "<<z<<endl;
        
        if(dis<z) continue;
        dis-=z;
        if(W[0]==1){
            cnt1++;
        }else{
            cnt1+=N-1;
        }
        
        dis%=(4*L);
        if(dis>=2*L){
            if(W[0]==1) cnt1+=N-1;
            else cnt1++;
        }
        
        cnt1%=N;
    }
    
    int app=0;
    
    for(int i=0;i<N;i++){
        if(goal[i]==G) app++;
    }
    
    if(app==1){
        for(int i=0;i<N;i++){
            if(goal[i]==G){
                int j;
                if(W[0]==2){
                    j=(i+cnt1)%N;
                }else{
                    j=(N+i-cnt1)%N;
                }
                
                //cout<<i<<" "<<j<<endl;
                
                vector<ll> ans(N);
                
                for(int k=0;k<N;k++){
                    ans[SS[k].se]=goal[(j+k)%N];
                }
                for(int k=0;k<N;k++) cout<<ans[k]<<" ";
                cout<<"\n";
                
                return 0;
            }
        }
    }else{
        if(W[0]==1){
            for(int i=1;i<N;i++){
                if(goal[i]==G&&goal[i-1]==G){
                    int j;
                    if(W[0]==2){
                        j=(i+cnt1)%N;
                    }else{
                        j=(N+i-cnt1)%N;
                    }
                    
                    //cout<<i<<" "<<j<<endl;
                    
                    vector<ll> ans(N);
                    
                    for(int k=0;k<N;k++){
                        ans[SS[k].se]=goal[(j+k)%N];
                    }
                    for(int k=0;k<N;k++) cout<<ans[k]<<" ";
                    cout<<"\n";
                    
                    return 0;
                }
            }
        }else{
            for(int i=0;i<N;i++){
                if(goal[i]==G){
                    int j;
                    if(W[0]==2){
                        j=(i+cnt1)%N;
                    }else{
                        j=(N+i-cnt1)%N;
                    }
                    
                    //cout<<i<<" "<<j<<endl;
                    
                    vector<ll> ans(N);
                    
                    for(int k=0;k<N;k++){
                        ans[SS[k].se]=goal[(j+k)%N];
                    }
                    for(int k=0;k<N;k++) cout<<ans[k]<<" ";
                    cout<<"\n";
                    
                    return 0;
                }
            }
        }
    }
    
    
}