Problem Statement

You are given a string S. Find the minimum length of a string that can be obtained by performing the following operation on the string S zero or more times.

• Choose a contiguous occurrence of of in the string and an integer i between 0 and K, inclusive. Then, remove the of and the following i characters from the string.

Input

The input is given from Standard Input in the following format:
S
K

Output

Print the answer.

Constraints

• $0 \leq K < |S| \leq 300$
• K is an integer.
• S is a string consisting of lowercase English letters.

Sample Input 1

keyofscience
3

Sample Output 1

7

By choosing the of formed by the fourth and fifth characters and setting i = 3, you can remove ofsci from keyofscience and get keyence.
It is impossible to reduce the length of the string to 6 or less by repeating the operation, so the answer is 7.

Sample Input 2

oofsifffence
3

Sample Output 2

2

Sample Input 3

ooofff
5

Sample Output 3

0

Sample Input 4

okeyencef
4

Sample Output 4

9

见题面 Input 部分

见题面 Output 部分