#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define rep(i,n) for(int (i) = 0 ; (i) < (n) ; (i)++)
#define rng(i,s,n) for(int (i) = (s) ; (i) < (n) ; (i)++)
#define mkp make_pair
#define vec vector
#define pb emplace_back
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) lower_bound(all(b),(i))-b.begin()
#define ssp(i,n) (i==(int)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define pp(x,y) pb(H{x,y})
#define ppp(x,y,z) pb(Q(x,y,z))
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) for(int qq123_=(n);qq123_;qq123_--)
//#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr int MXN = 500000 + 100;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
const vec<int>dx{ -1,1,0,0 }, dy{ 0,0,-1,1 };
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(bool g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }
void printh(H t) { printf("%lld %lld\n", t.fs, t.sc); }
bool inarea(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll lcm(ll i, ll j) { return i / gcd(i, j) * j; }
ll mod_pow(ll x, ll n, ll p = mod) {
    ll res = 1; x %= p;
    while (n > 0) {
        if (n & 1) res = res * x % p;
        x = x * x % p;
        n >>= 1;
    }
    return res;
}//x^n%p
ll bitcount(ll x) {
    int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
    return sum;
}
/*constexpr int fn_ = 1000005;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll Mod = mod) {
    if (!fact_[0]) {
        fact_[0] = 1; comp_[0] = 1;
        for (int i = 1; i < fn_; i++)
            fact_[i] = fact_[i - 1] * i % Mod;
        comp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], Mod - 2, Mod);
        for (int i = fn_ - 2; i > 0; i--)
            comp_[i] = comp_[i + 1] * (i + 1) % Mod;
    }
    if (x < y) return 0;
    return fact_[x] * comp_[x - y] % Mod * comp_[y] % Mod;
}*/
//--------------------------------------------------------------
int n, k;
string s[100];
int cnt[100][100][3];
int c[100];
int dp[3][200000];
signed main() {
    cin >> n >> k;
    string joi = "JOI";
    rep(i, n) {
        cin >> s[i] >> c[i];
        rep(j, s[i].size()) rep(z, 3) cnt[i][j][z] = (j > 0 ? cnt[i][j - 1][z] : 0) + (s[i][j] == joi[z]);
    }
    rep(i, 3) {
        rng(j, 1, k + 1) dp[i][j] = inf;
        rep(j, n)rng(z, 1, k + 1) {
            chmin(dp[i][z], dp[i][max(0ll, z - cnt[j][s[j].size() - 1][i])] + c[j]);
        }
    }
    rep(i, 3)if (dp[i][k] == inf) {
        cout << -1 << endl;
        return 0;
    }
    int ans = inf;
    rep(i, n) rep(j, n) {
        rep(t, s[i].size() + 1) rep(r, s[j].size() + 1) {
            int sum = dp[0][max(0ll, k - (t > 0 ? cnt[i][t - 1][0] : 0))] +
                dp[1][max(0ll, k - (cnt[i][s[i].size() - 1][1] - (t > 0 ? cnt[i][t - 1][1] : 0)) - (r > 0 ? cnt[j][r - 1][1] : 0))] +
                dp[2][max(0ll, k - (cnt[j][s[j].size() - 1][2] - (r > 0 ? cnt[j][r - 1][2] : 0)))];
            sum += c[i] + c[j];
            chmin(ans, sum);
        }
    }
    rep(i, n) {
        rep(j, s[i].size())rng(z, j, s[i].size()) {
            //[j,z]をOに割り当てる
            if (cnt[i][z][1] - (j > 0 ? cnt[i][j - 1][1] : 0) >= k) {
                chmin(ans, c[i] + dp[0][max(0ll, k - (j > 0 ? cnt[i][j - 1][0] : 0))] + dp[2][k - (cnt[i][s[i].size() - 1][2] - cnt[i][z][2])]);
            }
        }
    }
    cout << ans << endl;
}