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 Perl (v5.18.2) (judge verdict: Wrong Answer)

chomp($s = <>);
chomp($n = <>);

$cnt = 0;
$t = "";

for (split(//, $s)){
	if($t ne ""){
		if($_ eq substr($t,0,1)){
			$t .= $_;
		}else{
			$cnt += int(length($t) / 2);
			$t = $_;
		}
	}else{
		$t = $_;
	}
}

if($cnt == 0){
	$cnt = int(length($t) * $n / 2);
}else{
	$cnt += int(length($t) / 2);
	$cnt = $cnt * $n;
	$cnt = $cnt + $n - 1 if((substr($s, length($s) - 2, 1) ne substr($s, length($s) - 1, 1)) and (substr($s, 0, 1) eq substr($s, length($s) - 1, 1)));
}

print "$cnt\n";