{"raw_statement":[{"iden":"problem statement","content":"Takahashi has decided to work on $K$ days of his choice from the $N$ days starting with tomorrow.\nYou are given an integer $C$ and a string $S$. Takahashi will choose his workdays as follows:\n\n*   After working for a day, he will refrain from working on the subsequent $C$ days.\n*   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.\n\nFind all days on which Takahashi is bound to work."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq K \\leq N$\n*   $0 \\leq C \\leq N$\n*   The length of $S$ is $N$.\n*   Each character of $S$ is `o` or `x`.\n*   Takahashi can choose his workdays so that the conditions in Problem Statement are satisfied."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$ $C$\n$S$"},{"iden":"sample input 1","content":"11 3 2\nooxxxoxxxoo"},{"iden":"sample output 1","content":"6\n\nTakahashi 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.\nThere are four possible choices for his workdays: Day $1,6,10$, Day $1,6,11$, Day $2,6,10$, and Day $2,6,11$.\nThus, he is bound to work on Day $6$."},{"iden":"sample input 2","content":"5 2 3\nooxoo"},{"iden":"sample output 2","content":"1\n5\n\nThere is only one possible choice for his workdays: Day $1,5$."},{"iden":"sample input 3","content":"5 1 0\nooooo"},{"iden":"sample output 3","content":"There may be no days on which he is bound to work."},{"iden":"sample input 4","content":"16 4 3\nooxxoxoxxxoxoxxo"},{"iden":"sample output 4","content":"11\n16"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}