#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#define endl codeforces
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t ...Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t ...Args> using mdarray = typename multi_dem_array<T, Args...>::type;
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }

ll sim(ll cur, ll n, const std::string &s) {
    for (char c : s) {
        if (c == 'L') cur = std::max<ll>(0, cur - 1);
        else cur = std::min<ll>(cur + 1, n - 1);
    }
    return cur;
}

const ll inf = 5e15;

int main() {
    ll n, m;
    std::cin >> n >> m;
    vec<ll> av(n);
    for (ll &e : av) std::cin >> e;
    std::string s;
    std::cin >> s;
    vec<pll> pv, mv;
    ll sum = 0;
    for (ll i = 0; i < s.size(); i++) {
        if (s[i] == 'L') sum--;
        else sum++;
        if (0 < sum) pv.emplace_back(sum, i);
        else if (sum < 0) mv.emplace_back(-sum, i);
    }

    std::sort(ALL(pv));
    std::sort(ALL(mv));
    pv.emplace_back(inf, inf);
    mv.emplace_back(inf, inf);

    vec<ll> ans(n, 0);
    ll lastl = sim(0, n, s);
    ll lastr = sim(n - 1, n, s);
    ans[lastl] += av[0];
    ans[lastr] += av[n - 1];
    for (ll i = 1; i < n - 1; i++) {
        ll l = i, r = n - i;
        auto itel = std::lower_bound(ALL(mv), pll(l, -inf));
        auto iter = std::lower_bound(ALL(pv), pll(r, -inf));
        ll lidx = itel->second, ridx = iter->second;
        if (lidx < ridx) {
            ans[lastl] += av[i];
        } else if (lidx > ridx) {
            ans[lastr] += av[i];
        } else {
            ans[i + sum] += av[i];
        }
    }

    for (ll i = 0; i < n; i++) std::cout << ans[i] << " \n"[i + 1 == n];
    return 0;
}