#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    int n, k; cin>>n>>k;
    string s; cin>>s;
    int dp[200020]={};
    int sum[400040]={};
    for(int i=n-1; i>=0; i--){
        if(i>0 && s[i-1]=='x'){
            sum[i]=sum[i+1];
            continue;
        }
        if(sum[i+1]-sum[i+k+1]==0) dp[i]=1;
        sum[i]=sum[i+1]+dp[i];
    }
  bool dame=1;
    for(int i=1; i<=k; i++){
        if(dp[i]==1){
            cout<<i<<endl;
          dame=0;
        }
    }
  if(dame) cout<<0<<endl;
    return 0;
}