#pragma comment(linker, "/STACK:1024000000,1024000000")

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<vector>

#include<map>

#include<set>

#include<queue>

#include<stack>

#include<ctime>

#include<iostream>

using namespace std;

typedef long long LL;

const double pi=acos(-1.0);

void File()

{

    freopen("D:\\in.txt","r",stdin);

    freopen("D:\\out.txt","w",stdout);

}

template <class T>

inline void read(T &x)

{

    char c = getchar();

    x = ;

    while(!isdigit(c)) c = getchar();

    while(isdigit(c))

    {

        x = x *  + c - '';

        c = getchar();

    }

}

int n,a,b,k;

char s[];

struct X

{

    int L;

    int cnt;

}t[];

int sz,cnt;

int sum;

int main()

{

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

    cin>>s;

    for(int i=;s[i];)

    {

        if(s[i]=='')

        {

            int j;

            for(j=i;s[j];j++)

            {

                if(s[j]=='') continue;

                break;

            }

            j--;

            t[sz].L=i;

            t[sz].cnt=j-i+;

            sz++;

            i=j+;

        }

        else i++;

    }

    for(int i=;i<sz;i++) sum=sum+t[i].cnt/b;

    int now=;

    printf("%d\n",sum-a+);

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

    {

        for(int j=;j<=t[i].cnt/b;j++)

        {

            printf("%d ",t[i].L+j*b);

            now++;

            if(now==sum-a+) break;

        }

        if(now==sum-a+) break;

    }

    return ;

}