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; }
real readReal() { return readToken.to!real; }

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 M = readInt();
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      const S = readToken();
      
      int calc(int start) {
        int x = start;
        foreach (c; S) {
          switch (c) {
            case 'L': {
              if (x > 0) {
                --x;
              }
            } break;
            case 'R': {
              if (x < N - 1) {
                ++x;
              }
            } break;
            default: assert(false);
          }
        }
        return x;
      }
      int check(int start) {
        int x = start;
        foreach (c; S) {
          switch (c) {
            case 'L': {
              --x;
              if (x == 0) {
                return -1;
              }
            } break;
            case 'R': {
              ++x;
              if (x == N - 1) {
                return +1;
              }
            } break;
            default: assert(false);
          }
        }
        return 0;
      }
      
      int a = 0, b = N;
      for (; a + 1 < b; ) {
        const mid = (a + b) / 2;
        ((check(mid) == -1) ? a : b) = mid;
      }
      int c = -1, d = N - 1;
      for (; c + 1 < d; ) {
        const mid = (c + d) / 2;
        ((check(mid) == +1) ? d : c) = mid;
      }
      
      auto ans = new int[N];
      if (a < d) {
        // [0, a]
        ans[calc(0)] += A[0 .. a + 1].sum;
        // [d, N - 1]
        ans[calc(N - 1)] += A[d .. N].sum;
        // [b, c]
        const resB = calc(b);
        ans[resB .. resB + (c - b + 1)] += A[b .. c + 1];
      } else {
        ans[calc(0)] += A.sum;
      }
      
      foreach (i; 0 .. N) {
        if (i > 0) write(" ");
        write(ans[i]);
      }
      writeln();
    }
  } catch (EOFException e) {
  }
}