#include <bits/stdc++.h>
#define range(i, l, r) for(long long int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    if (v.size() == 0) return os << "]";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    lint N, K, R, S, P;
    string T;
    cin >> N >> K >> R >> S >> P >> T;
    unordered_map<char, char> to_winning_hand = {
        {'r', 'p'}, {'p', 's'}, {'s', 'r'}
    };
    // 'r' -> 0, 'p' -> 1, 's' -> 2
    unordered_map<char, lint> c_to_idx = {
        {'r', 0}, {'p', 1}, {'s', 2}
    };
    vec<lint> score = {R, P, S};
    vec<lint> winning_hand(N);
    range(i, 0, N) winning_hand.at(i) = c_to_idx.at(to_winning_hand.at(T.at(i)));
    vec<vec<lint>> groups(K, vec<lint>());
    range(r, 0, K) {
        for (lint q = 0; q * K + r < N; q++) {
            groups.at(r).emplace_back(winning_hand.at(q * K + r));
        }
    }
    // cout << groups << "\n";
    lint ans = 0;
    range(r, 0, K) {
        const auto& group = groups.at(r);
        if (!groups.size()) continue;
        vec<vec<lint>> max_score(group.size(), vec<lint>(3, 0));
        max_score.at(0).at(winning_hand.at(r)) = score.at(winning_hand.at(r));
        range(q, 1, group.size()) {
            lint idx = q * K + r;
            range(h, 0, 3) range(o, 0, 3) {
                if (o == h) continue;
                max_score.at(q).at(h) = max(
                    max_score.at(q).at(h),
                    max_score.at(q - 1).at(o) + (h == winning_hand.at(idx) ? score.at(h) : 0)
                );
            }
        }
        lint max_score_of_this = 0;
        range(h, 0, 3) max_score_of_this = max(max_score_of_this, max_score.at(group.size() - 1).at(h));
        ans += max_score_of_this;
    }
    cout << ans << "\n";
}

Measured memory_bytes: 7364