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

#define all(x) x.begin(), x.end()
#define all1(x) x.begin() + 1, x.end()
#define bit1(x) __builtin_popcountll(x)
#define Pqueue priority_queue
#define lc p << 1
#define rc p << 1 | 1
#define IOS ios::sync_with_stdio(false), cin.tie(0);
#define fi first
#define se second
#define lowbit(x) (x & -x)

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<ll, ll> PII;

const ll mod = 1000000007;
const ll N = 1e6 + 10;
const ld eps = 1e-9;
const ll inf = 1e18;
const ll P = 131;
const ll dir[8][2] = {1, 0, 0, 1, -1, 0, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1};

struct BIT
{
    int n;
    vector<ll> tr;

    BIT() {};
    BIT(int N) : n(N)
    {
        tr.resize(n + 1);
    };

    void change(int pos, int k)
    {
        int x = pos;
        while (x <= n)
        {
            tr[x] += k;
            x += lowbit(x);
        }
    }
    ll query(int pos)
    {
        ll sum = 0, x = pos;
        while (x)
        {
            sum += tr[x];
            x -= lowbit(x);
        }
        return sum;
    }
    ll query(int l, int r)
    {
        return query(r) - query(l - 1);
    }
};

void solve()
{
    ll n, m;
    cin >> n >> m;
    vector<ll> p(n + 1);
    for (ll i = 1; i <= n; i++)
        cin >> p[i];
    string s;
    cin >> s;
    BIT bit(n);
    ll ans = 0;
    for (ll i = 1; i <= n; i++)
    {
        ans += bit.query(p[i] + 1, n);
        bit.change(p[i], 1);
    }
    deque<int> sq;
    for (int i = 1; i <= n; i++)
        sq.push_back(p[i]);
    cout << ans << "\n";
    ll l = 1;
    bool flag = 0;
    for (auto i : s)
    {
        if (i == 'S')
        {
            if (!flag)
            {
                ll x = sq.front();
                sq.pop_front();
                ans -= x - 1;
                ans += n - x;
                sq.push_back(x);
            }
            else
            {
                ll x = sq.back();
                sq.pop_back();
                ans += x - 1;
                ans -= n - x;
                sq.push_front(x);
            }
        }
        else
            flag = !flag;
        if (!flag)
            cout << ans % 10;
        else
            cout << (n * (n - 1) - ans) % 10;
    }
    cout << "\n";
}

int main()
{
    IOS int T = 1;
    // cin>>T;
    while (T--)
        solve();
    return 0;
}

/*
oxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxox
x                                                                                      o
o       _/_/_/_/                                                              _/       x
x      _/                                                                              o
o     _/_/_/_/ _/  _/_/   _/_/   _/_/_/ _/_/   _/_/_/     _/_/    _/_/_/    _/ _/   _/ x
x    _/       _/_/     _/    _/ _/   _/   _/  _/    _/ _/    _/  _/    _/  _/   _/ _/  o
o   _/       _/       _/    _/ _/   _/   _/  _/    _/ _/    _/  _/    _/  _/    _/_/   x
x  _/       _/         _/_/   _/   _/   _/  _/_/_/     _/_/ _/ _/    _/  _/      _/    o
o                                          _/                           _/      _/     x
x                                         _/                        _/_/       _/      o
o                                                                                      x
xoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxo
*/