#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, K, T;
    cin >> N >> K >> T;
    vector<char> a(N);
    vector<int> b(N);
    cin >> a >> b;

    vector<int> v, ord(N);
    for (int i = 0; i < N; i++) {
        ll cur = b[i];
        if (a[i] == 'A')
            cur -= T;
        else
            cur += T;
        debug(cur);
        ll f = floor(cur, 1LL * K);
        if (~f & 1)
            cur = cur - K * f;
        else
            cur = K - (cur - K * f);
        debug(cur);
        v.emplace_back(cur);
    }
    iota(all(ord), 0);
    sort(all(ord), [&](int l, int r) { return b[l] > b[r]; });
    sort(rbegin(v), rend(v));
    vector<int> ans(N);
    for (int i = 0; i < N; i++) ans[ord[i]] = v[i];
    cout << ans << '\n';
    return 0;
}