#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <deque>

using namespace std;

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);i++)
#define all(i,n) (i),(i+n)

int dx4[4]={1,0,-1,0};
int dy4[4]={0,-1,0,1};
int dx8[8]={1,0,-1,1,-1,1,0,-1};
int dy8[8]={1,1,1,0,0,-1,-1,-1};

typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
typedef pair<ll, ll> PLL;

const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6+1;
const ll mod = 1000000007;

// --------------------------------------
int n, m;
string s;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin >> n >> m;
  deque<int> que;

  REP(i, n) {
    int a;
    cin >> a;
    que.push_back(a);
  }

  cin >> s;

  REP(i, m) {
    if(s[i] == 'L') {
      int l = que.at(0); que.pop_front();
      l += que.at(0); que.pop_front();
      que.push_front(l);
      que.push_back(0);
    } else {
      int r = que.at(n - 1); que.pop_back();
      r += que.at(n - 2); que.pop_back();
      que.push_back(r);
      que.push_front(0);
    }
  }

  for_each(que.begin(), que.end(), [](int x) {
    cout << x << endl;
  });
}