Simulate directly according to the meaning of the question
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int Maxn=200000+10;
int n,m,ans;
char a[Maxn];
inline int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')w=-1;ch=getchar();}
while(ch>='0' && ch<='9')s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
return s*w;
}
int main()
{
n=read(),m=read();
scanf("%s",a+1);
for(int i=1;i<=n;++i)
{
if(a[i]=='o')++m;
else --m;
if(m<0)m=0;
}
printf("%d\n",m);
return 0;
}