#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, K, T;
  cin >> N >> K >> T;
  vector<char> a(N);
  for (int i = 0; i < N; i++){
    cin >> a[i];
  }
  vector<int> b(N);
  for (int i = 0; i < N; i++){
    cin >> b[i];
  }
  vector<int> c(N);
  for (int i = 0; i < N; i++){
    if (a[i] == 'B'){
      c[i] = b[i] + T;
    } else {
      c[i] = b[i] - T;
    }
    c[i] %= K * 2;
    if (c[i] < 0){
      c[i] += K * 2;
    }
    c[i] = min(c[i], K * 2 - c[i]);
  }
  sort(c.begin(), c.end());
  vector<pair<int, int>> P(N);
  for (int i = 0; i < N; i++){
    P[i] = make_pair(b[i], i);
  }
  sort(P.begin(), P.end());
  vector<int> ans(N);
  for (int i = 0; i < N; i++){
    ans[P[i].second] = c[i];
  }
  for (int i = 0; i < N; i++){
    cout << ans[i];
    if (i < N - 1){
      cout << ' ';
    }
  }
  cout << endl;
}