CodeForces - 729D（思路）

D. Sea Battle

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard 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 bconsecutive 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.

题意是有n个位置，在这n个位置之中停有a艘船，每艘船的长度都是b，有k个位置已知没有船（即为1），未知的未知为0，问在这0个点之中射击多少个点一定能打中一艘船，然后输出每个点的坐标（坐标可能有很多组，满足题意即可），下面贴出AC码，和样例的坐标完全不同。。。；

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<stdlib.h>
#include<queue>
#include<vector>
#define mem(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define M 200005
typedef long long LL;
using namespace std;
int main()
{
    int map[M],p[M];
    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;
            }
        }
    else
        //为1，则一定没有船，从0开始计数
        sum=0;
    }
    //由于只需要打掉一条船，那么只需将可能有船的点打到只剩a-1个就行了
    printf("%d\n",ans-(a-1));
    for(int i=1;i<=ans-a+1;i++)
        printf("%d ",p[i]);
}