Contest Duration: - (local time) (150 minutes) Back to Home
A - Connection and Disconnection /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 制約

• 1 \leq |S| \leq 100
• S は英小文字からなる
• 1 \leq K \leq 10^9
• K は整数である

### 入力

S
K


### 入力例 1

issii
2


### 出力例 1

4


Tissiiissii です。例えば、Tispiqisyhi に書き換えれば、どの隣り合う 2 文字も異なるようにできます。

### 入力例 2

qq
81


### 出力例 2

81


### 入力例 3

cooooooooonteeeeeeeeeest
999993333


### 出力例 3

8999939997


Score : 300 points

### Problem Statement

Given is a string S. Let T be the concatenation of K copies of S. We can repeatedly perform the following operation: choose a character in T and replace it with a different character. Find the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.

### Constraints

• 1 \leq |S| \leq 100
• S consists of lowercase English letters.
• 1 \leq K \leq 10^9
• K is an integer.

### Input

Input is given from Standard Input in the following format:

S
K


### Output

Print the minimum number of operations required.

### Sample Input 1

issii
2


### Sample Output 1

4


T is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.

### Sample Input 2

qq
81


### Sample Output 2

81


### Sample Input 3

cooooooooonteeeeeeeeeest
999993333


### Sample Output 3

8999939997