#include #include using namespace std; using ll = long long; #define REP(i,n) for(int i=0;i void chmin(T& a, T b) { a = min(a, b); } template void chmax(T& a, T b) { a = max(a, b); } #define PR(x) cerr << #x << "=" << x << endl using i128 = __int128_t; int main() { ll n, k, t; cin >> n >> k >> t; vector ab(n); vector b(n); REP(i, n) { char c; cin >> c; ab[i] = c - 'A'; } REP(i, n) cin >> b[i]; vector ord(n); iota(ALL(ord), 0); sort(ALL(ord), [&](int i, int j){ return b[i] < b[j]; }); REP(i, n) { if(ab[i] == 1) { ll nb = (b[i] + t) % (2*k); if(nb > k) nb = 2*k-nb; b[i] = nb; } else { ll nb = (k - b[i] + t) % (2*k); if(nb > k) nb -= k; else nb = k - nb; b[i] = nb; } } sort(ALL(b)); vector ans(n); REP(i, n) { ans[ord[i]] = b[i]; } REP(i, n) cout << ans[i] << ' '; return 0; }