Problem:
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

Solution in Ruby (2.7.1) (judge verdict: Wrong Answer)

n=gets.chomp.split("").map(&:to_s)
v=n[0]
n.push(v)
#p n
t=gets.to_i
i=1
count=0
count
count_zero=0
while i<=n.length-1
    #p i
    if i==n.length-1 && n[i-1]==n[i]
        n[i]="#"
             count_zero=1
             i+=1
             next
    elsif n[i-1]==n[i]
        n[i]="#"
        count+=1
        i+=1
        next
   
    end
    i+=1
end

p count*t+count_zero*t