import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.net.ConnectException; import java.rmi.dgc.Lease; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Deque; import java.util.HashMap; import java.util.HashSet; import java.util.List; import java.util.Map; import java.util.NoSuchElementException; import java.util.Objects; import java.util.Set; import java.util.Stack; import java.util.TreeMap; import java.util.TreeSet; import static java.util.Comparator.*; public class Main { public static void main(String[] args) { Main main = new Main(); main.solve(); main.out.close(); } // ====================================================================== public void solve() { int N = ni(); int M = ni(); long[] A = nl(N); char[] C = ns().toCharArray(); int min = 0, max = 0, cnt = 0; for (int i = 0; i < M; i++) { if(C[i] == 'L') cnt--; else cnt++; min = Math.min(min, cnt); max = Math.max(max, cnt); } if(min < 0) { for (int i = 0; i < (N-1 <= -min ? N-1 : -min); i++) { A[i+1] += A[i]; A[i] = 0; } } if(max > 0) { for (int i = N-1; i > (N-1 - max < 0 ? 0 : N-1 - max); i--) { A[i-1] += A[i]; A[i] = 0; } } if(cnt >= 0) { cnt = (cnt > N - 1 ? N - 1 : cnt); for (int i = 0; i < cnt; i++) { out.print(0 + " "); } for (int i = 0; i < N - cnt; i++) { out.print(A[i] + " "); } } else { cnt = (-cnt > N - 1 ? N - 1 : -cnt); for (int i = cnt; i < N; i++) { out.print(A[i] + " "); } for (int i = 0; i < cnt; i++) { out.print(0 + " "); } } out.println(""); } // ------------------------------------------ // ライブラリ // ------------------------------------------ // Print private PrintWriter out = new PrintWriter(System.out); // Scanner private FastScanner scan = new FastScanner(); int ni() { return scan.nextInt(); } int[] ni(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) { a[i] = ni(); } return a; } int[][] ni(int y, int x) { int[][] a = new int[y][x]; for (int i = 0; i < y; i++) { for (int j = 0; j < x; j++) { a[i][j] = ni(); } } return a; } long nl() { return scan.nextLong(); } long[] nl(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) { a[i] = nl(); } return a; } long[][] nl(int y, int x) { long[][] a = new long[y][x]; for (int i = 0; i < y; i++) { for (int j = 0; j < x; j++) { a[i][j] = nl(); } } return a; } String ns() { return scan.next(); } String[] ns(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) { a[i] = ns(); } return a; } String[][] ns(int y, int x) { String[][] a = new String[y][x]; for (int i = 0; i < y; i++) { for (int j = 0; j < x; j++) { a[i][j] = ns(); } } return a; } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } public boolean hasNext() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } }