#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  ll n,k,t;
  cin>>n>>k>>t;
  t%=2*k;
  vector<char> A(n);
  vector<ll> B(n);
  rep(i,n) cin>>A[i];
  rep(i,n) cin>>B[i];
  
  vector<pair<ll,ll>> P(n);
  rep(i,n) P[i]={B[i],i};
  sort(ALL(P));
  vector<ll> D(n);
  rep(i,n) D[P[i].second]=i;
  
  vector<ll> C(n);
  rep(i,n){
    if(A[i]=='A'){
      if(t<=B[i]) C[i]=B[i]-t;
      else if(t<=B[i]+k) C[i]=t-B[i];
      else C[i]=2*k-t+B[i];
    }
    else{
      if(t<=k-B[i]) C[i]=t+B[i];
      else if(t<=2*k-B[i]) C[i]=2*k-t-B[i];
      else C[i]=t-2*k+B[i];
    }
  }
  sort(ALL(C));
  rep(i,n){
    if(i) cout<<" ";
    cout<<C[D[i]];
  }
  cout<<endl;
    
  return 0;
}