using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Globalization;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();

    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var a = NList;
        var s = ReadLine();
        var tmp = 0;
        var min = 0;
        var max = 0;
        var zero = 0;
        foreach (var si in s)
        {
            if (si == 'L')
            {
                --tmp;
                if (zero > 0) --zero;
            }
            else
            {
                ++tmp;
                if (zero + 1 < n) ++zero;
            }
            min = Math.Min(min, tmp);
            max = Math.Max(max, tmp);
        }
        min = Math.Max(-n, min);
        max = Math.Min(n - 1, max);
            var ans = new long[n];
        for (var i = 0; i < n; ++i)
        {
            if (i < -min) ans[zero] += a[i];
            else if (i + max < n) ans[zero + i + min] += a[i];
            else ans[zero + n - max + min - 1] += a[i];
        }
        WriteLine(string.Join(" ", ans));
    }
}