Contest Duration: - (local time) (100 minutes) Back to Home
D - Prediction and Restriction /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

• プレイヤーは筐体と N 回じゃんけんを行う (あいこの場合も 1 回のジャンケンと数える)。
• プレイヤーがじゃんけんで勝った場合、プレイヤーは出した手に応じて以下のスコアを得る (あいこや負けは 0 点)。
• グーで勝った場合、 R
• チョキで勝った場合、 S
• パーで勝った場合、 P
• ただし、ちょうど K 回前のじゃんけんで出した手と同じ手を出すことはできない。( K 回目までのじゃんけんでは好きな手を出せる。)

### 制約

• 2 \leq N \leq 10^5
• 1 \leq K \leq N-1
• 1 \leq R,S,P \leq 10^4
• N,K,R,S,P は全て整数である。
• |T| = N
• T に含まれる文字は r , s , p のいずれかである。

### 入力

N K
R S P
T


### 入力例 1

5 2
8 7 6
rsrpr


### 出力例 1

27


これに対して、例えば {パー、グー、グー、チョキ、パー} と出せば、27 点を獲得できます。 これより大きい点は獲得できないので、27 を出力します。

### 入力例 2

7 1
100 10 1
ssssppr


### 出力例 2

211


### 入力例 3

30 5
325 234 123
rspsspspsrpspsppprpsprpssprpsr


### 出力例 3

4996


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