/* made by amunduzbaev */
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
using namespace std;
//~ using namespace __gnu_pbds;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
//~ template<class T> using oset = tree<T,
//~ null_type, less_equal<T>, rb_tree_tag,
//~ tree_order_statistics_node_update> ordered_set;
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
#define MULTI 0
int n, m, k, s, t, q, ans, res, a[N];
int pref[3][N];
void solve(int t_case){
string s;
cin>>n>>k>>s;
vii tt[3];
for(int i=0;i<n;i++){
if(s[i] == 'J') tt[0].pb(i);
if(s[i] == 'O') tt[1].pb(i);
if(s[i] == 'I') tt[2].pb(i);
}
if(min({sz(tt[0]), sz(tt[1]), sz(tt[2])}) < k) { cout<<-1<<"\n"; return; }
mem(pref, 127);
deque<int> ss;
int cost = 0;
for(int i=0;i<k;i++) {
if(sz(ss)) cost += tt[0][i] - ss.back() - 1;
ss.pb(tt[0][i]);
}
pref[0][k-1] = cost;
for(int i=k;i<sz(tt[0]);i++){
if(sz(ss) > 1) cost -= ss[1] - ss[0] - 1;
ss.pop_front();
if(sz(ss)) cost += tt[0][i] - ss.back() - 1;
ss.pb(tt[0][i]);
pref[0][i] = cost;
} ss.clear(); cost = 0;
for(int i=sz(tt[2])-1;i>=sz(tt[2])-k;i--){
if(sz(ss)) cost += ss.back() - tt[2][i] - 1;
ss.pb(tt[2][i]);
}
pref[2][sz(tt[2])-k] = cost;
for(int i=sz(tt[2])-k-1;i>=0;i--){
if(sz(ss) > 1) cost -= ss[0] - ss[1] - 1;
ss.pop_front();
if(sz(ss)) cost += ss.back() - tt[2][i] - 1;
ss.pb(tt[2][i]);
pref[2][i] = cost;
}
//~ for(int i=0;i<sz(tt[0]);i++) cout<<pref[0][i]<<" ";
//~ cout<<"\n";
//~ for(int i=0;i<sz(tt[2]);i++) cout<<pref[2][i]<<" ";
//~ cout<<"\n";
int res = inf;
auto check = [&]() -> void{
auto lx = ub(all(tt[0]), ss.front());
auto rx = lb(all(tt[2]), ss.back());
if(lx != tt[0].begin() && rx != tt[2].end()){
int l = lx - tt[0].begin() - 1, r = rx - tt[2].begin();
umin(res, pref[0][l] + pref[2][r] + cost + (ss.front() - tt[0][l] - 1) + (tt[2][r] - ss.back() - 1));
}
};
ss.clear(); cost = 0;
for(int i=0;i<k;i++) {
if(sz(ss)) cost += tt[1][i] - ss.back() - 1;
ss.pb(tt[1][i]);
} check();
for(int i=k;i<sz(tt[1]);i++){
if(sz(ss) > 1) cost -= ss[1] - ss[0] - 1;
ss.pop_front();
if(sz(ss)) cost += tt[1][i] - ss.back() - 1;
ss.pb(tt[1][i]);
check();
} ss.clear(); cost = 0;
if(res == inf) cout<<-1<<"\n";
else cout<<res<<"\n";
}
signed main(){
NeedForSpeed
if(MULTI){
int t; cin>>t;
for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
} else solve(1);
return 0;
}
