Problem:
Score : 500 points

Problem Statement

Takahashi has decided to work on K days of his choice from the N days starting with tomorrow.

You are given an integer C and a string S. Takahashi will choose his workdays as follows:

After working for a day, he will refrain from working on the subsequent C days.

If the i-th character of S is x, he will not work on Day i, where Day 1 is tomorrow, Day 2 is the day after tomorrow, and so on.

Find all days on which Takahashi is bound to work.

Constraints

1 \leq N \leq 2 \times 10^5

1 \leq K \leq N

0 \leq C \leq N

The length of S is N.

Each character of S is o or x.

Takahashi can choose his workdays so that the conditions in Problem Statement are satisfied.

Input

Input is given from Standard Input in the following format:

N K C
S

Output

Print all days on which Takahashi is bound to work in ascending order, one per line.

Sample Input 1

11 3 2
ooxxxoxxxoo

Sample Output 1

6

Takahashi is going to work on 3 days out of the 11 days. After working for a day, he will refrain from working on the subsequent 2 days.

There are four possible choices for his workdays: Day 1,6,10, Day 1,6,11, Day 2,6,10, and Day 2,6,11.

Thus, he is bound to work on Day 6.

Sample Input 2

5 2 3
ooxoo

Sample Output 2

1
5

There is only one possible choice for his workdays: Day 1,5.

Sample Input 3

5 1 0
ooooo

Sample Output 3

There may be no days on which he is bound to work.

Sample Input 4

16 4 3
ooxxoxoxxxoxoxxo

Sample Output 4

11
16

Solution in C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;

namespace contest_Csharp
{
    class Program
    {
        static void Main(string[] args)
        {
            int N, K, C;
            var prop = Console.ReadLine().Split(' ')
                .Select(x => int.Parse(x)).ToList();
            N = prop[0];
            K = prop[1];
            C = prop[2];
            string S = Console.ReadLine();
            List<long> frontwork = new List<long>(), backwork = new List<long>(),
                recastleft = new List<long>(), capacity = new List<long>();
            long f = 0;
            long recast = 0;
            for (int i = 0; i < N; i++)
            {
                frontwork.Add(f);
                recastleft.Add(recast);


                if (S[i] == 'o' && recast == 0)
                {
                    f++;
                    recast = C;
                }
                else
                {
                    recast = Math.Max(recast - 1, 0);

                }
            }
            long b = 0;
            long brecast = 0;
            for (int i = (int)N - 1; i >= 0; i--)
            {
                backwork.Add(b);
                capacity.Add(C - brecast);


                if (S[i] == 'o' && brecast == 0)
                {
                    b++;
                    brecast = C;
                }
                else
                {
                    brecast = Math.Max(brecast - 1, 0);
                }
            }
            backwork.Reverse();
            capacity.Reverse();
            for (int i = 0; i < N; i++)
            {
                if (S[i] == 'o')
                {
                    if (frontwork[i] + backwork[i] < K ||
                        (frontwork[i] + backwork[i] == K && capacity[i] - recastleft[i] > C))
                    {
                        Console.Write((i + 1) + " ");
                    }
                }
            }

        }
    }
}