import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto S = RD!string;
	auto K = RD;
	/*string S;
	foreach (i; 0..3)
	{
		S ~= cast(char)(uniform(0, 3) + 'a');
	}
	long _ans;
	auto K = uniform(1, 4);
	{
		string T;
		foreach (i; 0..K)
			T ~= S;
		long i = 1;
		while (i < T.length)
		{
			if (T[i] == T[i-1])
			{
				++_ans;
				i += 2;
			}
			else
			{
				++i;
			}
		}
		debug writeln("S:", S);
		debug writeln("K:", K);
		debug writeln("T:", T);
		debug writeln("ans:", _ans);
	}*/

	long cnt;
	long i = 1;
	while (i < S.length)
	{
		if (S[i] == S[i-1])
		{
			++cnt;
			i += 2;
		}
		else
		{
			++i;
		}
	}

	debug writeln(cnt);

	long ans;
	if (S.length == 1)
	{
		ans = K/2;
	}
	else
	{
		if (S[0] != S[$-1])
		{
			ans = cnt*K;
		}
		else
		{
			long cnt2, cnt3;
			foreach (c; S)
			{
				if (S[0] != c) break;
				++cnt2;
			}
			foreach_reverse (c; S)
			{
				if (S[0] != c) break;
				++cnt3;
			}
			if (cnt2 == S.length)
			{
				ans = S.length * K / 2;
			}
			else if (cnt2 % 2 == 1 && cnt3 % 2 == 1)
			{
				ans = cnt*K+K-1;
			}
			else
			{
				ans = cnt*K;
			}
		}
	}

	writeln(ans);
	stdout.flush();
	debug readln();
}