#include <iostream>
#include <deque>

void solve() {
    int n, m;
    std::cin >> n >> m;

    std::deque<int> xs;
    for (int i = 0; i < n; ++i) {
        int x;
        std::cin >> x;
        xs.push_back(x);
    }

    while (m--) {
        char c;
        std::cin >> c;

        if (c == 'L') {
            auto f = xs.front();
            xs.pop_front();
            xs.front() += f;
            xs.push_back(0);

        } else {
            auto b = xs.back();
            xs.pop_back();
            xs.back() += b;
            xs.push_front(0);
        }
    }

    for (auto x : xs) std::cout << x << " ";
    std::cout << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}