#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    int N, K;
    cin >> N >> K;
    vector<string> S(N);
    vector<ll> C(N);
    rep(i, N) cin >> S[i] >> C[i];
    auto dp = make_vec(3 * K + 1, LINF);
    dp[0] = 0;
    vector<int> jnum(N), onum(N), inum(N);
    rep(i, N) {
        int j = 0, o = 0, u = 0;
        for(auto c : S[i]) {
            if(c == 'J') {
                j++;
            }
            if(c == 'O') {
                o++;
            }
            if(c == 'I') {
                u++;
            }

            jnum[i] = j, onum[i] = o, inum[i] = u;
        }
    }
    for(int i = 0; i < 3 * K; i++) {
        for(int j = 0; j < N; j++) {
            int now = i;
            if(i + jnum[j] < K) {
                dp[i + jnum[j]] = min(dp[i + jnum[j]], dp[i] + C[j]);
            } else if(i >= K && i + onum[j] < 2 * K) {
                dp[i + onum[j]] = min(dp[i + onum[j]], dp[i] + C[j]);
            } else if(i >= 2 * K) {
                dp[min(i + inum[j], 3 * K)] =
                    min(dp[min(i + inum[j], 3 * K)], dp[i] + C[j]);
            } else {
                for(int k = 0; k < S[j].size(); k++) {
                    if(now < K && S[j][k] == 'J')
                        now++;
                    else if(now >= K && now < 2 * K && S[j][k] == 'O')
                        now++;
                    else if(now >= 2 * K && now < 3 * K && S[j][k] == 'I')
                        now++;
                    if(now == 3 * K)
                        break;
                }
                dp[now] = min(dp[now], dp[i] + C[j]);
            }
        }
    }
    cout << (dp[3 * K] == LINF ? -1 : dp[3 * K]) << endl;
}