#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,K;
string S;

int win[404040];
int ng[404040];
int swin[404040];
int sng[404040];


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>K>>S;
	for(i=N+K;i>=N;i--) sng[i]=sng[i+1]+1;
	for(i=N-1;i>=0;i--) {
		if(i&&S[i-1]=='x') {
			sng[i]=sng[i+1]+1;
			ng[i]=1;
		}
		else {
			int cantgo=sng[i+1]-sng[i+K+1];
			int fail=swin[i+1]-swin[i+K+1];
			if(cantgo+fail<K) win[i]=1;
			sng[i]=sng[i+1];
		}
		swin[i]=swin[i+1]+win[i];
		
	}
	
	int w=0;
	for(i=1;i<=K;i++) if(ng[i]==0 && win[i]==0) {
		cout<<i<<endl;
		w=i;
	}
	if(w==0) cout<<0<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}