#include <bits/stdc++.h>
#define int long long
#define lowbit(x) x & (-x)
using namespace std;
const int N = 3e5 + 6;
int t[N << 2];
int mx;
void update(int now) {
    while(now <= mx) {
        t[now]++;
        now += lowbit(now);
    }
}

int query(int now) {
    int res = 0;
    while(now) {
        res += t[now];
        now -= lowbit(now);
    }
    return res;
}

void solve() {
    int n, m; cin >> n >> m;
    vector<int>a(n + 1);
    
    for(int i = 1; i <= n; i++) {
        cin >> a[i]; mx = max(mx, a[i]);
    }
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        ans += query(mx) - query(a[i]);
        update(a[i]);
    }
    cout << ans << endl;
    string s; cin >> s;
    int now = 1, f = 0;
    for(auto i : s) {
        if(i == 'S') {
            ans += n - a[now] - (a[now] - 1);
        } else {
            ans = n * (n - 1) / 2 - ans;
            f ^= 1;
        }
        if(f == 0) {
            now++;
            if(now == n + 1) now = 1;
        } else {
            now--;
            if(now == 0) now = n;
        }
        cout << ans % 10;
    } cout << '\n';
 
}


signed main() {
	ios::sync_with_stdio(false);
	int tt = 1;
	// cin >> tt;
	while (tt--) {
		solve();
	}
}