using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Numerics;

class Program
{
    static void Main(string[] args)
    {
        var wrong_answer = new wrong_answer();
        wrong_answer.Solve();
    }
}

public class wrong_answer
{
    const int INF = 1 << 30;
    const long INFL = 1L << 60;
    const int MOD = 1000000007;
    const int MOD2 = 998244353;

    myinout IO = new myinout();
    Math2 mmath = new Math2();

    //functions




    public void Solve()
    {
        //ここから
        var o = IO.intm;
        var n = o[0];
        var k = o[1];
        var oo = IO.intm;
        var r = oo[0];
        var s = oo[1];
        var p = oo[2];
        var point = new int[3, 3];//me aite
        for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) point[i, j] = 0;
        point[0, 1] = r;
        point[1, 2] = s;
        point[2, 0] = p;
        var t = IO.str;

        int[] other = new int[n];
        for (int i = 0; i < n; ++i)
        {
            if (t[i] == 'r') other[i] = 0;
            if (t[i] == 's') other[i] = 1;
            if (t[i] == 'p') other[i] = 2;

        }
        var ss = new char[n];
        var ans = 0L;
        for (int i = 0; i < n; ++i)
        {
            var kati = (other[i] - 1) % 3;
            if (kati < 0) kati += 3;
            var make = (other[i] + 1) % 3;

            if (i < k)
            {
                ss[i]= (char)(kati+'0');
                ans += point[kati, other[i]];
            }
            else
            {
                if (kati == ss[i - k] - '0')
                {
                    if(i+k<n)other[i] = other[i + k];
                    ss[i] = (char)(other[i] + '0');
                }
                else
                {
                    ss[i] = (char)(kati + '0');
                    ans += point[kati, other[i]];
                }
            }
        }

        IO.wri(ans);

    }
    static IEnumerable<int> Primes(int maxnum)
    {
        // var sieve = new BitArray(maxnum + 1, true);
        bool[] sieve = Enumerable.Repeat(true, maxnum + 1).ToArray();
        int squareroot = (int)Math.Sqrt(maxnum);
        for (int i = 2; i <= squareroot; i++)
        {
            if (sieve[i] == false)
                continue;
            for (int n = i * 2; n <= maxnum; n += i)
                sieve[n] = false;
        }
        for (int i = 2; i <= maxnum; i++)
            if (sieve[i] == true)
                yield return i;
    }
}





//b-aで降順

public class Math2
{
    public long[] fact;
    public long[] invfact;
    public void factoricalmodset(long N, long MOD = 1000000007)
    {
        fact = new long[N + 1];
        invfact = new long[N + 1];
        fact[0] = 1;

        for (long i = 1; i <= N; ++i)
        {
            fact[i] = fact[i - 1] * i % MOD;
        }
        invfact[N] = pow(fact[N], MOD - 2);

        for (long i = N; i > 0; --i)
        {
            invfact[i - 1] = invfact[i] * i % MOD;
        }

    }

    public long nCr(long n, long r, long MOD = 1000000007)
    {
        return (fact[n] * invfact[r] % MOD * invfact[n - r] % MOD);
    }

    public long pow(long i, long n, long MOD = 1000000007)
    {
        long res = 1;
        while (n > 0)
        {
            if ((n & 1) != 0) res = res * i % MOD;
            i = i * i % MOD;
            n >>= 1;
        }
        return res;
    }

    public long gcd(long i, long y)
    {
        while (y != 0)
        {
            var r = i % y;
            i = y;
            y = r;
        }
        return i;
    }

    public long lcm(long i, long y)
    {
        return i * y / gcd(i, y);
    }

    public Dictionary<long, int> primefactorization(long N)
    {
        var ret = new Dictionary<long, int>();

        for (long i = 2; i * i <= N; ++i)
        {
            int cnt = 0;
            while (N % i == 0)
            {
                cnt++;
                N /= i;
            }
            if (cnt != 0) ret[i] = cnt;

        }
        if (N >= 2) ret[N] = 1;

        return ret;

    }

    public List<long> divisorenumrate(long N)
    {
        var ret = new List<long>();

        for (long i = 1; i * i <= N; ++i)
        {

            if (N % i == 0)
            {
                ret.Add(i);
                ret.Add(N / i);
            }

        }

        return ret;

    }

    public void swap<T>(ref T a, ref T b)
    {
        var i = a;
        a = b;
        b = i;
    }

}

class myinout
{
    //in
    public string str => Console.ReadLine();

    public string[] strm => str.Split(' ');

    public long[] longm => strm.Select(long.Parse).ToArray();
    public int[] intm => strm.Select(int.Parse).ToArray();
    public char[] charm => str.ToArray();
    public double[] doublem => strm.Select(double.Parse).ToArray();
    public long long1 => longm[0];
    public int int1 => intm[0];
    public char char1 => charm[0];
    public double double1 => doublem[0];



    //out
    public void wri<T>(T i)
    {
        Console.WriteLine(i);
    }
    public void wri<T>(T[] i)
    {
        Console.WriteLine(string.Join(" ", i));
    }

    public void yn(bool i)
    {
        if (i) wri("Yes");
        else wri("No");
    }

}


Measured memory_bytes: 14048