//For higher stack size use g++ -O2 -std=c++11 -Wall -Wl,--stack=268435456 a.cpp -o a.exe in cmd
    #include <bits/stdc++.h>
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    #include <cstring>
    #include <chrono>
    #include <complex>
    #define ll long long
    #define ld long double
    #define vi vector<int>
    #define vll vector<ll>
    #define vvi vector < vi >
    #define pii pair<int,int>
    #define pll pair<long long, long long>
    #define mod 1000000007
    #define inf 1000000000000000001;
    #define all(c) c.begin(),c.end()
    #define mp(x,y) make_pair(x,y)
    #define mem(a,val) memset(a,val,sizeof(a))
    #define eb emplace_back
    #define pb push_back
    #define f first
    #define s second
    
    using namespace std;

    bool comp(pii x,pii y)
    {
        if(x.f!=y.f)
            return x.f<y.f;
        return x.s>y.s;
    }

    int main()
    {
        std::ios::sync_with_stdio(false);
        int T;
        T=1;
        // cin.ignore(); must be there when using getline(cin, s)
        while(T--)
        {
            string s,s2;
            int n,k,c,i,j;
            cin>>n>>k>>c;
            cin>>s2;
            s="#";
            for(i=0;i<s2.size();++i)
            {
                s+=s2[i];
            }
            int dp[n+2],dp2[n+2],ar[n+2];
            for(i=0;i<=n+2;++i)
            {
                ar[i]=0;
            }
            dp[0]=0,dp2[n+1]=0,dp2[0]=0,dp[n+1]=0;
            for(i=1;i<=n;++i)
            {
                if(s[i]=='x')
                {
                    dp[i]=dp[i-1];
                }
                else
                {
                    dp[i]=dp[i-1];
                    if(i-c-1>=0)
                    {
                        dp[i]=max(dp[i],1+dp[i-c-1]);
                    }
                    else
                    {
                        dp[i]=max(dp[i],1);
                    }
                }
            }
            vector<pii> v;
            for(i=n;i>=1;--i)
            {
                if(s[i]=='x')
                {
                    dp2[i]=dp2[i+1];
                }
                else
                {
                    dp2[i]=dp2[i+1];
                    if(i+c+1<=n+1)
                    {
                        dp2[i]=max(dp2[i],dp2[i+c+1]+1);
                    }
                    else
                    {
                        dp2[i]=max(dp2[i],1);
                    }
                }
                v.pb({dp2[i],i});

            }
            sort(v.begin(),v.end(),comp);
            int x,y,pos;
            for(i=0;i<=n;++i)
            {
                if(k<=dp[i])
                    continue;
                pos=lower_bound(v.begin(),v.end(),mp(k-dp[i],0))-v.begin();
                if(pos==v.size())
                    continue;
                ar[i+1]+=1;
                ar[v[pos].s]-=1;
                
            }
            for(i=1;i<=n;++i)
            {
                if(dp[i]>=k)
                {
                    ar[i+1]+=1;
                    ar[n+1]-=1;
                    break;
                }
            }
            for(i=n+1;i>=1;--i)
            {
                if(dp2[i]>=k)
                {
                    ar[1]+=1;
                    ar[i]-=1;
                }
            }
            for(i=1;i<=n;++i)
            {
                ar[i]=ar[i-1]+ar[i];
            }
            for(i=1;i<=n;++i)
            {
                if(s[i]=='x' || ar[i]>0)
                    continue;
                cout<<i<<endl;
            }
        }
        return 0;
    }


Measured memory_bytes: 6024