#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>
#include <atcoder/all>

#include <bits/stdc++.h>


#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace atcoder;
using namespace std;
typedef long long int ll;
typedef modint998244353 mint;




ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;

    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

/*
解説動画参考
解説ブログ参考
フィボナッチ

*/




int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    
    while (Q--) {
        int n;
        cin >> n;
        int m;
        cin >> m;
        deque<ll>p(n);
        for (int i = 0; i < n; i++)cin >> p[i];
        string s;
        cin >> s;
        for (int i = 0; i < m; i++) {
            vector<ll>r;
            if (s[i] == 'L') {
                p[0] += p[1];
                p.erase(p.begin() + 1);
                p.push_back(0);
            }
            else {
                p[n - 1] += p[n - 2];
                p.erase(p.begin() + n - 2);
                p.push_front(0);
            }
        }
        for (int i = 0; i < n; i++)cout << p[i] << " ";
    }

    return 0;
}