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 Python (3.4.3) (judge verdict: Runtime Error)

s = input()
k = int(input())
t = ''
i = 0
count = 0
first = 0
end =  0
while s[0] ==s[i]:
	first += 1
	i = i + 1

i = len(s)-1
while s[i] ==s[len(s)-1]:
	end += 1
	i = i - 1


i =0
while i < len(s)-2:
	if s[i] == s[i+1]:
		if i == len(s)-2:
			count +=1
			i += 1
		if s[i+1] == s[i+2]:
			count += 1
			i += 2
		else: 
			count += 1
			i += 1
	else:
		i += 1

if i == len(s)-2:
	if s[i] == s[i+1]:
		count +=1
	if s[0] == s[len(s)-1]:
		if (first + end) %2 !=0
			count += 1
print(count*k)