#include<iostream>

 #include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 #include<set>

 #include<vector>

 #include<stack>

 #include<queue>

 #include<map>

 using namespace std;

 #define ll long long

 #define se second

 #define fi first

 const int Mos = 0x7FFFFFFF;  //

 const int nMos = 0x80000000;  //-2147483648

 const int N=2e5+;

 int n,a,b,k;

 char g[N];

 int d[N];

 int main()

 {

     cin>>n>>a>>b>>k;

     scanf("%s",g+);

     int cnt=,m=;

     for(int i=;i<=n;i++)

     {

         if(g[i]=='')

         {

             cnt++;

             if(cnt==b)

             {

                 cnt=;

                 d[m++]=i;

             }

         }

         if(g[i]=='')  cnt=;

     }

     m-=(a-);

     cout<<m<<endl;

     for(int i=;i<m-;i++)

         cout<<d[i]<<" ";

     cout<<d[m-]<<endl;

 }