Problem:
Score : 400 points

Problem Statement

At an arcade, Takahashi is playing a game called RPS Battle, which is played as follows:

The player plays N rounds of Rock Paper Scissors against the machine. (See Notes for the description of Rock Paper Scissors. A draw also counts as a round.)

Each time the player wins a round, depending on which hand he/she uses, he/she earns the following score (no points for a draw or a loss):

R points for winning with Rock;

S points for winning with Scissors;

P points for winning with Paper.

However, in the i-th round, the player cannot use the hand he/she used in the (i-K)-th round. (In the first K rounds, the player can use any hand.)

Before the start of the game, the machine decides the hand it will play in each round. With supernatural power, Takahashi managed to read all of those hands.

The information Takahashi obtained is given as a string T. If the i-th character of T (1 \leq i \leq N) is r, the machine will play Rock in the i-th round. Similarly, p and s stand for Paper and Scissors, respectively.

What is the maximum total score earned in the game by adequately choosing the hand to play in each round?

Notes

In this problem, Rock Paper Scissors can be thought of as a two-player game, in which each player simultaneously forms Rock, Paper, or Scissors with a hand.

If a player chooses Rock and the other chooses Scissors, the player choosing Rock wins;

if a player chooses Scissors and the other chooses Paper, the player choosing Scissors wins;

if a player chooses Paper and the other chooses Rock, the player choosing Paper wins;

if both players play the same hand, it is a draw.

Constraints

2 \leq N \leq 10^5

1 \leq K \leq N-1

1 \leq R,S,P \leq 10^4

N,K,R,S, and P are all integers.

|T| = N

T consists of r, p, and s.

Input

Input is given from Standard Input in the following format:

N K
R S P
T

Output

Print the maximum total score earned in the game.

Sample Input 1

5 2
8 7 6
rsrpr

Sample Output 1

27

The machine will play {Rock, Scissors, Rock, Paper, Rock}.

We can, for example, play {Paper, Rock, Rock, Scissors, Paper} against it to earn 27 points.
We cannot earn more points, so the answer is 27.

Sample Input 2

7 1
100 10 1
ssssppr

Sample Output 2

211

Sample Input 3

30 5
325 234 123
rspsspspsrpspsppprpsprpssprpsr

Sample Output 3

4996

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#ifdef LOCAL
#include <cstdio>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstring>
#else
#include <bits/stdc++.h>
#endif
using namespace std ;

typedef long long ll ;
typedef unsigned long long ull ;
#define rep(i , n ) for ( int i =0; i < n ; i++)
#define rrep(i , n) for ( int i = n-1; i >=0 ; i--)

#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb push_back
#define DEBUG(x) cout << #x << ": " << x << endl;

class UnionFind {
private:
	ull size_; 
	std::vector<ull> par, rank, count;

public:
	UnionFind() : size_(0), par(std::vector<ull>()), rank(std::vector<ull>()), count(std::vector<ull>()) {};
	UnionFind(ull size__) : size_(size__) {
		par.resize(size_); rank.resize(size_); count.resize(size__);
		for (ull i = 0; i < size_; i++) par[i] = i, rank[i] = 0, count[i] = 1;
	}
	ull size() { return size_; }
	// ull root(ull x) { return par[x] == x ? x : par[x] = root(par[x]); }
	
	ull root(ull x)
	{
		while(par[x] != x)
		{
			par[x] = par[par[x]];
			x = par[x];
		}
		return x;
	}
	
	bool same(ull x, ull y) { return root(x) == root(y); }

	void unite(ull x, ull y) {
		x = root(x), y = root(y);
		if (x == y) return;
		if (rank[x] < rank[y]) par[x] = y, count[y]+=count[x], count[x]=0;
		else if (rank[x] == rank[y]) par[y] = x, rank[x]++, count[x]+=count[y], count[y]=0;
		else par[y] = x, count[x] += count[y], count[y] = 0;
	}

	ull size__(ull x)
	{
		return count[root(x)];
	}

	bool operator==(const UnionFind &u) { return par == u.par; }
	bool operator!=(const UnionFind &u) { return par != u.par; }
};
/*
maybe sth wrong 
got wa in one problem
*/
ll modpow(ll a, ll b)
{
	if (b == 0)
	{
		return 1;
	}

	if (b % 2)
	{
		return a * modpow(a, b-1) % MOD;
	}
	else
	{
		ll halfB = b / 2;
		ll half = modpow(a, halfB);
		return half * half % MOD;
	}
}

ll calcComb(ll n, ll m)
{
	if (m > n-m)
	{
		return calcComb(n, n-m);
	}

	ll ansMul = 1;
	ll ansDiv = 1;

	rep(i, m)
	{
		ansMul *= (n-i);
		ansDiv *= (i+1);
		ansMul %= MOD;
		ansDiv %= MOD;
	}

	return ansMul * modpow(ansDiv, MOD - 2) % MOD;
}

__attribute__((constructor))
void initial()
{
	cin.tie(NULL);
	ios::sync_with_stdio(false);
}


int main()
{
	ll n, k;
	cin >> n >> k;

	ll r, s, p;
	cin >> r >> s >> p;

	string t;
	cin >> t;

	#if 0
	ll dp[n+1][3] = {0};

	for (int i = 1; i <= n; i++)
	{
		if (i - k < 0)
		{
			if (t[i-1] == 'r')
			{
				// 0->r
				dp[i][0] = max(dp[i-1][0], max(dp[i-1][1], dp[i-1][2]));
				// 1->s
				dp[i][1] = max(dp[i-1][0], max(dp[i-1][1], dp[i-1][2]));
				// 2->p
				dp[i][2] = max(dp[i-1][0], max(dp[i-1][1], dp[i-1][2])) + p;
			}
			else if (t[i-1] == 's')
			{
				// 0->r
				dp[i][0] = max(dp[i-1][0], max(dp[i-1][1], dp[i-1][2])) + r;
				// 1->s
				dp[i][1] = max(dp[i-1][0], max(dp[i-1][1], dp[i-1][2]));
				// 2->p
				dp[i][2] = max(dp[i-1][0], max(dp[i-1][1], dp[i-1][2]));
			}

			else if (t[i-1] == 'p')
			{
				// 0->r
				dp[i][0] = max(dp[i-1][0], max(dp[i-1][1], dp[i-1][2]));
				// 1->s
				dp[i][1] = max(dp[i-1][0], max(dp[i-1][1], dp[i-1][2])) + s;
				// 2->p
				dp[i][2] = max(dp[i-1][0], max(dp[i-1][1], dp[i-1][2]));
			}
		}
		else
		{
			for (int j = 0; j < k; j++)
			{

			}
		}
	
	}
	#endif
	ll ans = 0;

	rep(i, k)
	{
		if (t[i] == 'r')
		{
			ans += p;
		}
		else if (t[i] == 's')
		{
			ans += r;
		}
		else if (t[i] == 'p')
		{
			ans += s;
		}
	}

	for (int j = k; j < n; j++)
	{
		if (t[j] == t[j-k])
		{
			t[j] = 0;
		}
		else
		{
			if (t[j] == 'r')
			{
				ans += p;
			}
			else if (t[j] == 's')
			{
				ans += r;
			}
			else if (t[j] == 'p')
			{
				ans += s;
			}
		}
		
	}
	cout << ans << endl;

	return 0;
}