// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
#define SP << " " <<

typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;

const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr int MOD = (1000000007);
// const int MOD = (998244353);
// const int INF = (1 << 30); // 1073741824
const int INF = (1LL << 60); // 1152921504606846976
const double EPS = (1 >> 30);

template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template<class T> inline T ceil(T a, T b) {return T((a + b - 1)/b);}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }

int nmax=200000; // 2*(10^5)
vvec g(nmax);



signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    //---------------------------------------------
    
    int n,m;
    cin>>n>>m;
    vector<int> a(n);
    rep(i,n) cin >> a[i];
    string s;
    cin>>s;
    int r=0,l=0;
    int idr=n-1;
    int idl=0;
    rep(i,m){
        if(s[i]=='R'){
            l=min(l+1,n-1);
            if(r==0&&idr!=0){
                a[idr-1]+=a[idr],a[idr]=0,idr--;
                if(idr<idl) idl--;
            }

            r=max(0LL,r-1);
        }
        else{
            r=min(r+1,n-1);
            if(l==0&&idl!=n-1){
                a[idl+1]+=a[idl],a[idl]=0,idl++;
                if(idr<idl) idr++;
            }
            l=max(0LL,l-1);
        }
    }

    // debug(l);debug(r);debug(idl);debug(idr);
    /*
    rep(i,n){
        cout<<a[i]<<" ";
    }
    cout<<endl;
    */
    rep(i,l) cout<<0<<" ";

    for(int i=min(idl,idr);i<=max(idr,idl);i++){
        cout<<a[i]<<" ";
    }

    rep(i,r) cout<<0<<" ";
}