#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, k, t; cin >> n >> k >> t;
  vector<char> a(n); REP(i, n) cin >> a[i];
  vector<int> b(n); REP(i, n) cin >> b[i];
  vector<int> c(n);
  REP(i, n) {
    int x = b[i], y = k - b[i];
    if (a[i] == 'B') swap(x, y);
    if (t < x) {
      x -= t; y += t;
    } else {
      int tm = t - x;
      x = k; y = 0;
      a[i] = (a[i] == 'A' ? 'B' : 'A');
      tm %= k * 2;
      if (tm >= k) {
        tm -= k;
        a[i] = (a[i] == 'A' ? 'B' : 'A');
      }
      x -= tm;
      y += tm;
    }
    c[i] = (a[i] == 'A' ? x : y);
  }
  ranges::sort(c);
  vector<int> order(n);
  iota(order.begin(), order.end(), 0);
  ranges::sort(order, {}, [&](const int i) -> int { return b[i]; });
  vector<int> ans(n);
  REP(i, n) ans[order[i]] = c[i];
  REP(i, n) cout << ans[i] << " \n"[i + 1 == n];
  return 0;
}