//#pragma GCC optimize("O3")
//#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair<long, long>
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define ff first
#define ss second
#define pb push_back
#define db pop_back
#define mp make_pair
#define mt make_tuple
#define g(a, b) get<a>(b)
#define INF (ll)1e18 + 100
#define vl vector<ll>
#define vi vector<int>
#define vll vector<pair<ll, ll>>
#define vii vector<pair<int, int>>
#define all(v) v.begin(),v.end()
#define bset(a, p) ((a) | (1ll << (p)))
#define bchk(a, p) ((a) & (1ll << (p)))
#define bxor(a, p) ((a) ^ (1ll << (p)));
#define brem(a, p) (bchk(a, p) ? (bxor(a, p)) : (a))
/*SOME BITMASK KNOWLEDGE
1)x & (x - 1):sets the last one bit of x to zero
power of two exactly when x & (x − 1) = 0.
2)x & -x:sets all the one bits to zero, except last one bit
3)x | (x - 1):inverts all the bits after the last one bit*/
#define endl "\n"
#define p0(a) cout << a << " "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c << endl
#define p4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl

#define o_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define o_setll tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
//member functions :
//1. order_of_key(k) : number of elements strictly lesser than k
//2. find_by_order(k) : k-th element in the set

ll modI(ll a, ll m);
ll gcd(ll a, ll b);
ll powM(ll x, unsigned ll y, unsigned ll m);
void pairsort(int a[], int b[], int n);
void pairsortll(ll a[],ll b[],ll n);
ll logint(ll x,ll y);
 
 
ll gcd(ll x,ll y)
{
    if(x==0) return y;
    return gcd(y%x,x);
}
 
ll powM(ll x,ll y,ll m)
{
    if(y==0) return 1;
    ll p=powM(x,y/2,m)%m;
    p=(p*p)%m;
    return (y%2==0)?p:(x*p)%m;
}
 
ll modI(ll a, ll m)
{
   return powM(a, m-2, m);
}
 
void pairsort(int a[],int b[],int n)
{
    pair<int,int> v[n];
    REP(i,0,n)
    {
        v[i].ff=a[i];
        v[i].ss=b[i];
    }
    sort(v,v+n);
    REP(i,0,n)
    {
        a[i]=v[i].ff;
        b[i]=v[i].ss;
    }
}
 
void pairsortll(ll a[],ll b[],ll n)
{
    pair<ll,ll> v[n];
    REP(i,0,n)
    {
        v[i].ff=a[i];
        v[i].ss=b[i];
    }
    sort(v,v+n);
    REP(i,0,n)
    {
        a[i]=v[i].ff;
        b[i]=v[i].ss;
    }
}
 
ll logint(ll x,ll y)
{
    ll ans=0;
    ll a=1;
    for(ll i=0;i<=x;i++)
    {
        if(x<a)
        {
            return ans;
        }
        ans++;
        a*=y;
    }
    return -1;
}
const int N = 2e5+5;
ll dp[N][3];
int main()
{
    ll n, k;
    cin>>n>>k;
    ll r, s, p;
    cin>>r>>s>>p;
    string t;
    cin>>t;
    ll ans=0;
    REP(i, 0, k){
        //memset(dp, 0, sizeof(dp));
        if(t[i] == 'r'){
            dp[i][0] = 0;
            dp[i][1] = p;
            dp[i][2] = 0;
        }
        else if(t[i] == 'p'){
            dp[i][0] = 0;
            dp[i][1] = 0;
            dp[i][2] = s;
        }
        else{
            dp[i][0] = r;
            dp[i][1] = 0;
            dp[i][2] = 0;
        }
        ll last = i;
        ll sum ;//= max({dp[i][0], dp[i][1], dp[i][2]});
        for(ll j = i+k; j<n; j+=k){
            last = j;
            if(t[j] == 'r'){
            dp[j][0] = max(dp[j-k][1],dp[j-k][2])+0;
            dp[j][1] = max(dp[j-k][0],dp[j-k][2])+p;
            dp[j][2] = max(dp[j-k][1],dp[j-k][0])+0;
        }
        else if(t[j] == 'p'){
            dp[j][0] = max(dp[j-k][1],dp[j-k][2])+0;
            dp[j][1] = max(dp[j-k][0],dp[j-k][2])+0;
            dp[j][2] = max(dp[j-k][1],dp[j-k][0])+s;
        }
        else{
            dp[j][0] = max(dp[j-k][1],dp[j-k][2])+r;
            dp[j][1] = max(dp[j-k][0],dp[j-k][2])+0;
            dp[j][2] = max(dp[j-k][1],dp[j-k][0])+0;
        }
        }
        sum = max({dp[last][0], dp[last][1], dp[last][2]});
        ans += sum;
    }
    cout<<ans;
}


Measured memory_bytes: 4608