Sea Battle＜海战＞（思路题）

　　　　　　　　　　　　　　time limit per test1 second

　　　　　　　　　　　　memory limit per test256 megabytes

　　　　　　　　　　　　　　inputstandard input

　　　　　　　　　　　　　　outputstandard output

Galya is playing one-dimensional Sea Battle on a 1 × n grid. In this game a ships are placed on the grid. Each of the ships consists of b consecutive cells. No cell can be part of two ships, however, the ships can touch each other.

Galya doesn’t know the ships location. She can shoot to some cells and after each shot she is told if that cell was a part of some ship (this case is called “hit”) or not (this case is called “miss”).

Galya has already made k shots, all of them were misses.

Your task is to calculate the minimum number of cells such that if Galya shoot at all of them, she would hit at least one ship.

It is guaranteed that there is at least one valid ships placement.

Input

The first line contains four positive integers n, a, b, k (1 ≤ n ≤ 2·105, 1 ≤ a, b ≤ n, 0 ≤ k ≤ n - 1) — the length of the grid, the number of ships on the grid, the length of each ship and the number of shots Galya has already made.

The second line contains a string of length n, consisting of zeros and ones. If the i-th character is one, Galya has already made a shot to this cell. Otherwise, she hasn’t. It is guaranteed that there are exactly k ones in this string.

Output

In the first line print the minimum number of cells such that if Galya shoot at all of them, she would hit at least one ship.

In the second line print the cells Galya should shoot at.

Each cell should be printed exactly once. You can print the cells in arbitrary order. The cells are numbered from 1 to n, starting from the left.

If there are multiple answers, you can print any of them.

Examples

input

5 1 2 1

00100

output

2

4 2

input

13 3 2 3

1000000010001

output

2

7 11

Note

There is one ship in the first sample. It can be either to the left or to the right from the shot Galya has already made (the “1” character). So, it is necessary to make two shots: one at the left part, and one at the right part.

#include<queue>
#include<stack>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<numeric>//STL数值算法头文件
#include<stdlib.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<functional>//模板类头文件
using namespace std;

const int INF=1e9+7;
const int maxn=201000;
int main()
{
    int map[maxn],p[maxn];
    int n,a,b,k,sum=0,ans=0;
    scanf("%d%d%d%d",&n,&a,&b,&k);
    for(int i=1; i<=n; i++)
        scanf("%1d",&map[i]);
    for(int i=1; i<=n; i++)
    {
        if(map[i]==0)
        {
            sum++;
            //假设b个点就有一条船
            if(sum==b)
            {
                sum-=b;
                p[++ans]=i;
                //printf("p[ans]=%d \n",p[ans]);
            }
        }
        else //为1,则一定没有船,从0开始计数
            sum=0;
    }
    //一共a条船,由于只需要打掉一条船,那么只需将可能有船的点打到只剩　（a-1）　就行了　(**ans是每ｂ个数记一次**)
    printf("%d\n",ans-(a-1));
    for(int i=1; i<=ans-a+1; i++)
        printf("%d ",p[i]);
    return 0;
}