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

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    auto S = sread();
    long K = lread();
    long N = S.length;
    long[] len;
    long i;
    while (i < N)
    {
        long l;
        char prev = S[i];
        while (i + l < N && S[i + l] == prev)
            l++;
        len ~= l;
        i += l;
    }
    if (len.length == 1)
    {
        writeln(len[0] * K / 2);
        return;
    }
    long ans = len.map!"a/2"().sum() * K;
    if (S[0] == S[$ - 1])
    {
        ans -= (len[0] / 2) * (K - 1);
        ans -= (len[$ - 1] / 2) * (K - 1);
        ans += ((len[0] + len[$ - 1]) / 2) * (K - 1);
    }
    writeln(ans);
}
