The Longest X

Problem Description

You are given a string $S$ consisting of characters X and ..

You may perform the following operation between $0$ and $K$ times (inclusive):

• Replace a . with an X.

What is the maximum possible number of consecutive Xs in the resulting string $S$?

Input Format

The first line contains a string $S$.

The second line contains an integer $K$.

Output Format

Output one integer, the answer.

Sample Input 1

XX...X.X.X.
2

Sample Output 1

5

Sample Input 2

XXXX
200000

Sample Output 2

4

Constraints

For all test data, $1 \leq |S| \leq 2 \times 10^5$ and $0 \le K \le 2 \times 10^5$ are guaranteed.