import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const K = readLong;
      const T = readLong;
      auto C = new char[N];
      foreach (i; 0 .. N) {
        C[i] = readToken[0];
      }
      auto X = new long[N];
      foreach (i; 0 .. N) {
        X[i] = readLong;
      }
      
      alias XI = Tuple!(long, "x", int, "i");
      auto xis = new XI[N];
      foreach (i; 0 .. N) {
        xis[i] = XI(X[i], i);
      }
      xis.sort;
      
      auto ys = new long[N];
      foreach (i; 0 .. N) {
        if (C[i] == 'A') {
          ys[i] = ((2 * K - X[i]) + T) % (2 * K);
        } else if (C[i] == 'B') {
          ys[i] = (X[i] + T) % (2 * K);
        } else {
          assert(false);
        }
        chmin(ys[i], 2 * K - ys[i]);
      }
      ys.sort;
      
      auto ans = new long[N];
      foreach (i; 0 .. N) {
        ans[xis[i].i] = ys[i];
      }
      foreach (i; 0 .. N) {
        if (i) write(" ");
        write(ans[i]);
      }
      writeln;
    }
  } catch (EOFException e) {
  }
}