/** * author: otera **/ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; typedef long double ld; const int inf=1e9+7; const ll INF=1LL<<60 ; const ll mod=1e9+7 ; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef complex Point; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair P; typedef pair LDP; typedef pair LP; #define fr first #define sc second #define all(c) c.begin(),c.end() #define pb push_back #define debug(x) cerr << #x << " = " << (x) << endl; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } void solve() { int n, k; cin >> n >> k; vector s(n); vector c(n); rep(i, n) { cin >> s[i] >> c[i]; } vector> cnt(n, vector(3, 0)); string JOI = "JOI"; rep(i, n) { rep(j, 3) { cnt[i][j] = count(all(s[i]), JOI[j]); } } static int dp[300300]; rep(i, 300300) { dp[i] = INF; } dp[0] = 0; string t = string(k, 'J') + string(k, 'O') + string(k, 'I') + string(k, '?'); rep(i, 3 * k) { rep(j, n) { int pos = i; int sz = (int)s[j].size(); if(t[i] == t[i + sz]) { pos += cnt[j][i / k]; } else { for(char c: s[j]) { if(t[pos] == c) ++ pos; } } chmin(dp[pos], dp[i] + c[j]); } } if(dp[3 * k] == INF) { cout << -1 << endl; } else { cout << dp[3 * k] << endl; } } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(10); //int t; cin >> t; rep(i, t)solve(); solve(); return 0; }