Problem Statement

You are given a string $S$ of length $N$ consisting of lowercase English letters. You may now perform the operations described below.

• In each odd-numbered operation, choose one place among the contiguous subsequences of $S$ where con occurs $A$ times in a row, and change it to coon. If there is no place in the contiguous subsequences of $S$ where con occurs $A$ times in a row, this operation cannot be performed.
• In each even-numbered operation, choose one place among the contiguous subsequences of $S$ where con occurs $B$ times in a row, and change it to coon. If there is no place in the contiguous subsequences of $S$ where con occurs $B$ times in a row, this operation cannot be performed.

Find the maximum number of times the operation can be performed.

Input

$N$ $A$ $B$
$S$

• $N, A, B$ are integers.
• $1 \leq N \leq 5 \times 10^4$
• $1 \leq A,B \leq N$
• $S$ is a string of length $N$ consisting of lowercase English letters.

Output

Output the answer.

Sample

7 1 2
contest

1

15 1 2
confoxconconfox

2

19 1 1
kudamakitsukasacoon

0

21 2 3
conconconconconconcon

3