#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define vec vector<int>
#define vecll vector<ll>
#define vecpii vector<pii>
#define vecpll vector<pll>
#define vec2(a,b) vector<vec>(a,vec(b))
#define vec2ll(a,b) vector<vecll>(a,vecll(b))
#define vec2ll(a,b,c) vector<vecll>(a,vecll(b,c))
#define vec3(a,b,c) vector<vector<vec>>(a,vec2(b,c))
#define vec3ll(a,b,c) vector<vector<vecll>>(a,vec2ll(b,c))
#define fi first
#define se second
#define all(c) begin(c),end(c)
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),(x)))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),(x)))
using namespace std;
int in() {int x;cin>>x;return x;}
ll lin() {ll x;cin>>x;return x;}
string stin() {string s;cin>>s;return s;}
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
vec iota(int n){vec a(n);iota(all(a),0);return a;}
void print(){putchar(' ');}
void print(bool a){cout<<a;}
void print(int a){cout<<a;}
void print(long long a){cout<<a;}
void print(char a){cout<<a;}
void print(string &a){cout<<a;}
void print(double a){cout<<a;}
template<class T> void print(const vector<T>&);
template<class T, size_t size> void print(const array<T, size>&);
template<class T, class L> void print(const pair<T, L>& p);
template<class T, size_t size> void print(const T (&)[size]);
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } cout<<endl;}
template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } }
template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } }
template<class T, class L> void print(const pair<T, L>& p){ cout<<'(';print(p.first); cout<<","; print(p.second);cout<<')'; }
template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ cout<<" "; print(*i); } }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
ll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }
ll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }
#define _GLIBCXX_DEBU
#define endl '\n'
#ifdef _MY_DEBUG
    #undef endl
    #define debug(x) cout<<#x<<": "<<x<<endl
    void err(){}
    template<class T> void err(const T& t){ print(t);  cout<<" ";}
    template<class Head, class... Tail> void err(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); }
#else
    #define debug(x)
    template<class... T> void err(const T&...){}
#endif
#pragma endregion

//それ、オーバーフローしない？！？！

constexpr ll INF = 1e16;
signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);cout<<fixed<<setprecision(15);
    int n=in(),k=in();
    vector<string> s;
    vector<ll> c;
    rep(i,n){
        s.pb(stin());
        c.pb(in());
    }
    vector<ll> J(k+1,1e16),O(k+1,1e16),I(k+1,1e16);
    {
        vector<ll> tmp(81,INF);
        rep(i,n)chmin(tmp[count(all(s[i]),'J')],c[i]);
        J[0]=0;
        rep2(i,1,k){
            rep2(j,max(0LL,i-80),i-1){
                chmin(J[i],J[j] + tmp[i-j]);
            }
        }
    }
    {
        vector<ll> tmp(81,INF);
        rep(i,n)chmin(tmp[count(all(s[i]),'O')],c[i]);
        O[0]=0;
        rep2(i,1,k){
            rep2(j,max(0LL,i-80),i-1){
                chmin(O[i],O[j] + tmp[i-j]);
            }
        }
    }
    {
        vector<ll> tmp(81,INF);
        rep(i,n)chmin(tmp[count(all(s[i]),'I')],c[i]);
        I[0]=0;
        rep2(i,1,k){
            rep2(j,max(0LL,i-80),i-1){
                chmin(I[i],I[j] + tmp[i-j]);
            }
        }
    }
    auto JO = vec2ll(81,81,INF),OI = vec2ll(81,81,INF);
    JO[0][0]=0;
    OI[0][0]=0;
    rep(i,n){
        rep(j,s[i].size()){
            chmin(JO[count(s[i].begin(),s[i].begin()+j,'J')][count(s[i].begin()+j,s[i].end(),'O')],c[i]);
            chmin(OI[count(s[i].begin(),s[i].begin()+j,'O')][count(s[i].begin()+j,s[i].end(),'I')],c[i]);
        }
    }
    ll ans=INF;
    rep(i,81){
        rep(j,81){
            if(i+j>80)continue;
            rep(ii,81){
                rep(jj,81){
                    if(k<i or j+ii > k or jj>k)continue;
                    chmin(ans,J[k-i]+O[k-j-ii]+I[k-jj]+JO[i][j]+OI[ii][jj]);
                }
            }
        }
    }
    if(k<=80){
        auto JI = vec2ll(80,80,INF);
        rep(i,n){
            rep(p,s[i].size()){
                rep2(q,p+1,s[i].size()){
                    if(count(s[i].begin()+p,s[i].begin()+q,'O')>=k){
                        chmin(JI[count(s[i].begin(),s[i].begin()+p,'J')][count(s[i].begin()+q,s[i].end(),'I')],c[i]);
                    }
                }
            }
        }
        rep(i,80){
            rep(j,80){
                if(i+j+k>80 or k<i or k<j)continue;
                chmin(ans,J[k-i]+JI[i][j]+I[k-j]);
            }
        }
    }
    if(ans>=INF){
        cout<<-1<<endl;
    }
    else
    cout << ans << endl;
}